/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 19:23:37,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 19:23:37,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 19:23:37,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 19:23:37,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 19:23:37,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 19:23:37,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 19:23:37,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 19:23:37,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 19:23:37,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 19:23:37,231 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 19:23:37,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 19:23:37,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 19:23:37,232 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 19:23:37,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 19:23:37,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 19:23:37,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 19:23:37,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 19:23:37,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 19:23:37,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 19:23:37,233 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 19:23:37,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 19:23:37,234 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 19:23:37,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 19:23:37,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 19:23:37,235 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 19:23:37,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 19:23:37,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:23:37,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 19:23:37,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 19:23:37,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 19:23:37,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 19:23:37,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 19:23:37,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 19:23:37,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 19:23:37,237 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 19:23:37,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 19:23:37,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 19:23:37,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 19:23:37,501 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 19:23:37,502 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 19:23:37,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-08-26 19:23:38,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 19:23:38,547 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 19:23:38,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-08-26 19:23:38,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93aa48e79/3402f06debd1428293153af7c0dbc9f0/FLAGf22d52108 [2023-08-26 19:23:38,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93aa48e79/3402f06debd1428293153af7c0dbc9f0 [2023-08-26 19:23:38,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 19:23:38,565 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 19:23:38,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 19:23:38,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 19:23:38,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 19:23:38,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a5f89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38, skipping insertion in model container [2023-08-26 19:23:38,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,583 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 19:23:38,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:23:38,702 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 19:23:38,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:23:38,746 INFO L206 MainTranslator]: Completed translation [2023-08-26 19:23:38,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38 WrapperNode [2023-08-26 19:23:38,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 19:23:38,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 19:23:38,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 19:23:38,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 19:23:38,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,790 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2023-08-26 19:23:38,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 19:23:38,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 19:23:38,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 19:23:38,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 19:23:38,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 19:23:38,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 19:23:38,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 19:23:38,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 19:23:38,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (1/1) ... [2023-08-26 19:23:38,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:23:38,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:38,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 19:23:38,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 19:23:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 19:23:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 19:23:38,878 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 19:23:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 19:23:38,878 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 19:23:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 19:23:38,878 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 19:23:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 19:23:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 19:23:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 19:23:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-26 19:23:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-26 19:23:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-26 19:23:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-26 19:23:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 19:23:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 19:23:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 19:23:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 19:23:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 19:23:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 19:23:38,881 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 19:23:38,981 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 19:23:38,982 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 19:23:39,291 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 19:23:39,297 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 19:23:39,297 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 19:23:39,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:23:39 BoogieIcfgContainer [2023-08-26 19:23:39,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 19:23:39,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 19:23:39,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 19:23:39,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 19:23:39,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:23:38" (1/3) ... [2023-08-26 19:23:39,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c42c627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:23:39, skipping insertion in model container [2023-08-26 19:23:39,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:23:38" (2/3) ... [2023-08-26 19:23:39,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c42c627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:23:39, skipping insertion in model container [2023-08-26 19:23:39,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:23:39" (3/3) ... [2023-08-26 19:23:39,304 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2023-08-26 19:23:39,315 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 19:23:39,315 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-08-26 19:23:39,315 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 19:23:39,363 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-26 19:23:39,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 194 transitions, 436 flow [2023-08-26 19:23:39,478 INFO L124 PetriNetUnfolderBase]: 14/188 cut-off events. [2023-08-26 19:23:39,479 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 19:23:39,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 188 events. 14/188 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 132 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-08-26 19:23:39,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 194 transitions, 436 flow [2023-08-26 19:23:39,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 171 transitions, 378 flow [2023-08-26 19:23:39,490 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:23:39,498 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 171 transitions, 378 flow [2023-08-26 19:23:39,502 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 171 transitions, 378 flow [2023-08-26 19:23:39,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 171 transitions, 378 flow [2023-08-26 19:23:39,541 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2023-08-26 19:23:39,541 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 19:23:39,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 171 events. 14/171 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 131 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-08-26 19:23:39,543 INFO L119 LiptonReduction]: Number of co-enabled transitions 3780 [2023-08-26 19:23:45,875 INFO L134 LiptonReduction]: Checked pairs total: 4775 [2023-08-26 19:23:45,876 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-26 19:23:45,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:23:45,888 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4669b51, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:23:45,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-26 19:23:45,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:23:45,890 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 19:23:45,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:45,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:45,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 19:23:45,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:45,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash 676, now seen corresponding path program 1 times [2023-08-26 19:23:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820031783] [2023-08-26 19:23:45,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:45,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820031783] [2023-08-26 19:23:45,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820031783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:45,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 19:23:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538436050] [2023-08-26 19:23:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:45,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 19:23:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 19:23:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 19:23:45,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 352 [2023-08-26 19:23:45,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:45,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:45,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 352 [2023-08-26 19:23:45,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:46,228 INFO L124 PetriNetUnfolderBase]: 3537/4292 cut-off events. [2023-08-26 19:23:46,228 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-08-26 19:23:46,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8781 conditions, 4292 events. 3537/4292 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11032 event pairs, 1737 based on Foata normal form. 0/2116 useless extension candidates. Maximal degree in co-relation 6140. Up to 4293 conditions per place. [2023-08-26 19:23:46,248 INFO L140 encePairwiseOnDemand]: 350/352 looper letters, 59 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2023-08-26 19:23:46,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 59 transitions, 272 flow [2023-08-26 19:23:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 19:23:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 19:23:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 407 transitions. [2023-08-26 19:23:46,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.578125 [2023-08-26 19:23:46,264 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 407 transitions. [2023-08-26 19:23:46,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 407 transitions. [2023-08-26 19:23:46,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:46,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 407 transitions. [2023-08-26 19:23:46,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 203.5) internal successors, (407), 2 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:46,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:46,275 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:46,276 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 158 flow. Second operand 2 states and 407 transitions. [2023-08-26 19:23:46,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 59 transitions, 272 flow [2023-08-26 19:23:46,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 248 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-26 19:23:46,284 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 130 flow [2023-08-26 19:23:46,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2023-08-26 19:23:46,289 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-08-26 19:23:46,289 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 130 flow [2023-08-26 19:23:46,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:46,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:46,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:23:46,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 19:23:46,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:46,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 666036, now seen corresponding path program 1 times [2023-08-26 19:23:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956663259] [2023-08-26 19:23:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956663259] [2023-08-26 19:23:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956663259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400486903] [2023-08-26 19:23:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:46,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:46,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:46,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 19:23:46,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:46,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:46,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 19:23:46,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:47,076 INFO L124 PetriNetUnfolderBase]: 3375/4096 cut-off events. [2023-08-26 19:23:47,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:47,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8258 conditions, 4096 events. 3375/4096 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10426 event pairs, 1656 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 8255. Up to 4096 conditions per place. [2023-08-26 19:23:47,089 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 56 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-08-26 19:23:47,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 240 flow [2023-08-26 19:23:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-26 19:23:47,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4251893939393939 [2023-08-26 19:23:47,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-26 19:23:47,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-26 19:23:47,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:47,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-26 19:23:47,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,097 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 130 flow. Second operand 3 states and 449 transitions. [2023-08-26 19:23:47,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 240 flow [2023-08-26 19:23:47,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:23:47,102 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 128 flow [2023-08-26 19:23:47,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-08-26 19:23:47,103 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-08-26 19:23:47,103 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 128 flow [2023-08-26 19:23:47,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:47,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:23:47,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 19:23:47,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:47,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash 666035, now seen corresponding path program 1 times [2023-08-26 19:23:47,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:47,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777218735] [2023-08-26 19:23:47,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:47,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:47,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:47,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777218735] [2023-08-26 19:23:47,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777218735] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:47,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:47,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920317841] [2023-08-26 19:23:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:47,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:47,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:47,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:47,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:47,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 19:23:47,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:47,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 19:23:47,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:47,461 INFO L124 PetriNetUnfolderBase]: 3213/3900 cut-off events. [2023-08-26 19:23:47,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:47,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 3900 events. 3213/3900 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9844 event pairs, 1575 based on Foata normal form. 0/1954 useless extension candidates. Maximal degree in co-relation 7864. Up to 3900 conditions per place. [2023-08-26 19:23:47,476 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 54 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-08-26 19:23:47,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 234 flow [2023-08-26 19:23:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-08-26 19:23:47,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403409090909091 [2023-08-26 19:23:47,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-08-26 19:23:47,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-08-26 19:23:47,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:47,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-08-26 19:23:47,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,480 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 128 flow. Second operand 3 states and 465 transitions. [2023-08-26 19:23:47,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 234 flow [2023-08-26 19:23:47,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:47,482 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 125 flow [2023-08-26 19:23:47,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-26 19:23:47,482 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2023-08-26 19:23:47,482 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 125 flow [2023-08-26 19:23:47,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:47,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:23:47,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 19:23:47,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:47,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash 640076806, now seen corresponding path program 1 times [2023-08-26 19:23:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:47,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547004594] [2023-08-26 19:23:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:47,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:47,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547004594] [2023-08-26 19:23:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547004594] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571198720] [2023-08-26 19:23:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:47,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:47,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:47,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:47,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 19:23:47,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:47,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 19:23:47,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:47,775 INFO L124 PetriNetUnfolderBase]: 3141/3808 cut-off events. [2023-08-26 19:23:47,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:47,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7685 conditions, 3808 events. 3141/3808 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9565 event pairs, 1539 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 7681. Up to 3808 conditions per place. [2023-08-26 19:23:47,791 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 52 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-08-26 19:23:47,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 227 flow [2023-08-26 19:23:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-26 19:23:47,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4384469696969697 [2023-08-26 19:23:47,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-26 19:23:47,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-26 19:23:47,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:47,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-26 19:23:47,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,796 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 125 flow. Second operand 3 states and 463 transitions. [2023-08-26 19:23:47,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 227 flow [2023-08-26 19:23:47,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:47,798 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 122 flow [2023-08-26 19:23:47,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-26 19:23:47,799 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -15 predicate places. [2023-08-26 19:23:47,799 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 122 flow [2023-08-26 19:23:47,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:47,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:23:47,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 19:23:47,800 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:47,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 640076805, now seen corresponding path program 1 times [2023-08-26 19:23:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936825310] [2023-08-26 19:23:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936825310] [2023-08-26 19:23:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936825310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:47,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:47,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239879061] [2023-08-26 19:23:47,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:47,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:47,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:47,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 19:23:47,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:47,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:47,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 19:23:47,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:48,138 INFO L124 PetriNetUnfolderBase]: 3069/3716 cut-off events. [2023-08-26 19:23:48,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:48,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7502 conditions, 3716 events. 3069/3716 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9299 event pairs, 1503 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 7498. Up to 3716 conditions per place. [2023-08-26 19:23:48,150 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 50 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-26 19:23:48,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 220 flow [2023-08-26 19:23:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-26 19:23:48,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41950757575757575 [2023-08-26 19:23:48,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-26 19:23:48,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-26 19:23:48,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:48,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-26 19:23:48,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,156 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 122 flow. Second operand 3 states and 443 transitions. [2023-08-26 19:23:48,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 220 flow [2023-08-26 19:23:48,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:48,158 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 119 flow [2023-08-26 19:23:48,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-26 19:23:48,160 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -16 predicate places. [2023-08-26 19:23:48,160 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 119 flow [2023-08-26 19:23:48,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:48,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:48,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 19:23:48,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:48,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash 933500805, now seen corresponding path program 1 times [2023-08-26 19:23:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:48,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114074445] [2023-08-26 19:23:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114074445] [2023-08-26 19:23:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114074445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:48,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:48,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612862378] [2023-08-26 19:23:48,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:48,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:48,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:48,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:48,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:48,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 19:23:48,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:48,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 19:23:48,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:48,444 INFO L124 PetriNetUnfolderBase]: 3021/3652 cut-off events. [2023-08-26 19:23:48,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:48,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7375 conditions, 3652 events. 3021/3652 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9115 event pairs, 1479 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 7371. Up to 3652 conditions per place. [2023-08-26 19:23:48,459 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 48 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-08-26 19:23:48,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 213 flow [2023-08-26 19:23:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-26 19:23:48,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2023-08-26 19:23:48,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-26 19:23:48,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-26 19:23:48,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:48,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-26 19:23:48,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,464 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 119 flow. Second operand 3 states and 441 transitions. [2023-08-26 19:23:48,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 213 flow [2023-08-26 19:23:48,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:48,466 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 116 flow [2023-08-26 19:23:48,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-26 19:23:48,468 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2023-08-26 19:23:48,469 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 116 flow [2023-08-26 19:23:48,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:48,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:48,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 19:23:48,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:48,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:48,470 INFO L85 PathProgramCache]: Analyzing trace with hash 933500806, now seen corresponding path program 1 times [2023-08-26 19:23:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:48,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083538468] [2023-08-26 19:23:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083538468] [2023-08-26 19:23:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083538468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782762074] [2023-08-26 19:23:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:48,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:48,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:48,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 19:23:48,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:48,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 19:23:48,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:48,703 INFO L124 PetriNetUnfolderBase]: 2973/3588 cut-off events. [2023-08-26 19:23:48,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:48,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7248 conditions, 3588 events. 2973/3588 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8927 event pairs, 1455 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 7244. Up to 3588 conditions per place. [2023-08-26 19:23:48,714 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 46 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-26 19:23:48,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 206 flow [2023-08-26 19:23:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-26 19:23:48,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4327651515151515 [2023-08-26 19:23:48,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-26 19:23:48,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-26 19:23:48,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:48,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-26 19:23:48,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,719 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 116 flow. Second operand 3 states and 457 transitions. [2023-08-26 19:23:48,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 206 flow [2023-08-26 19:23:48,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:48,720 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 113 flow [2023-08-26 19:23:48,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-26 19:23:48,720 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -18 predicate places. [2023-08-26 19:23:48,720 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 113 flow [2023-08-26 19:23:48,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:48,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:48,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 19:23:48,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:48,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -553874017, now seen corresponding path program 1 times [2023-08-26 19:23:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:48,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805412202] [2023-08-26 19:23:48,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805412202] [2023-08-26 19:23:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805412202] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690750927] [2023-08-26 19:23:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:48,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:48,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:48,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 19:23:48,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:48,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 19:23:48,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:48,935 INFO L124 PetriNetUnfolderBase]: 2901/3496 cut-off events. [2023-08-26 19:23:48,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:48,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7065 conditions, 3496 events. 2901/3496 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8649 event pairs, 1419 based on Foata normal form. 0/1798 useless extension candidates. Maximal degree in co-relation 7061. Up to 3496 conditions per place. [2023-08-26 19:23:48,945 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 44 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-26 19:23:48,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 199 flow [2023-08-26 19:23:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-08-26 19:23:48,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4308712121212121 [2023-08-26 19:23:48,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-08-26 19:23:48,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-08-26 19:23:48,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:48,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-08-26 19:23:48,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,949 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 113 flow. Second operand 3 states and 455 transitions. [2023-08-26 19:23:48,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 199 flow [2023-08-26 19:23:48,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:48,950 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 110 flow [2023-08-26 19:23:48,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-26 19:23:48,950 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2023-08-26 19:23:48,950 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 110 flow [2023-08-26 19:23:48,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:48,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:48,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:48,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 19:23:48,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:48,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash -553874018, now seen corresponding path program 1 times [2023-08-26 19:23:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:48,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93548925] [2023-08-26 19:23:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:48,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:48,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93548925] [2023-08-26 19:23:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93548925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929336973] [2023-08-26 19:23:48,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:48,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:49,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 19:23:49,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:49,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 19:23:49,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:49,132 INFO L124 PetriNetUnfolderBase]: 2829/3404 cut-off events. [2023-08-26 19:23:49,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:49,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 3404 events. 2829/3404 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8383 event pairs, 1383 based on Foata normal form. 0/1762 useless extension candidates. Maximal degree in co-relation 6878. Up to 3404 conditions per place. [2023-08-26 19:23:49,144 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 42 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-26 19:23:49,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 192 flow [2023-08-26 19:23:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-26 19:23:49,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2023-08-26 19:23:49,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-26 19:23:49,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-26 19:23:49,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:49,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-26 19:23:49,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,148 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 110 flow. Second operand 3 states and 435 transitions. [2023-08-26 19:23:49,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 192 flow [2023-08-26 19:23:49,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:49,149 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 107 flow [2023-08-26 19:23:49,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 19:23:49,149 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 19:23:49,149 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 107 flow [2023-08-26 19:23:49,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:49,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:49,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 19:23:49,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:49,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 303028016, now seen corresponding path program 1 times [2023-08-26 19:23:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:49,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623694655] [2023-08-26 19:23:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:49,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623694655] [2023-08-26 19:23:49,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623694655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:49,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:49,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573426775] [2023-08-26 19:23:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:49,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:49,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 352 [2023-08-26 19:23:49,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:49,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 352 [2023-08-26 19:23:49,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:49,309 INFO L124 PetriNetUnfolderBase]: 2667/3208 cut-off events. [2023-08-26 19:23:49,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:49,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6491 conditions, 3208 events. 2667/3208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7794 event pairs, 1302 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 6487. Up to 3208 conditions per place. [2023-08-26 19:23:49,319 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 40 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 19:23:49,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 185 flow [2023-08-26 19:23:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-26 19:23:49,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4100378787878788 [2023-08-26 19:23:49,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-26 19:23:49,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-26 19:23:49,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:49,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-26 19:23:49,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,323 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,323 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 107 flow. Second operand 3 states and 433 transitions. [2023-08-26 19:23:49,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 185 flow [2023-08-26 19:23:49,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:49,324 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 104 flow [2023-08-26 19:23:49,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-26 19:23:49,325 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -21 predicate places. [2023-08-26 19:23:49,325 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 104 flow [2023-08-26 19:23:49,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:49,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:49,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 19:23:49,326 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:49,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash 303028017, now seen corresponding path program 1 times [2023-08-26 19:23:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615440392] [2023-08-26 19:23:49,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615440392] [2023-08-26 19:23:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615440392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:49,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:49,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023782942] [2023-08-26 19:23:49,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:49,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:49,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:49,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:49,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:49,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 352 [2023-08-26 19:23:49,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:49,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 352 [2023-08-26 19:23:49,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:49,496 INFO L124 PetriNetUnfolderBase]: 2505/3012 cut-off events. [2023-08-26 19:23:49,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:49,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 3012 events. 2505/3012 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7196 event pairs, 1221 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 6096. Up to 3012 conditions per place. [2023-08-26 19:23:49,506 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 38 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 19:23:49,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 178 flow [2023-08-26 19:23:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-26 19:23:49,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4251893939393939 [2023-08-26 19:23:49,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-26 19:23:49,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-26 19:23:49,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:49,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-26 19:23:49,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,510 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 104 flow. Second operand 3 states and 449 transitions. [2023-08-26 19:23:49,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 178 flow [2023-08-26 19:23:49,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 39 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:49,511 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 101 flow [2023-08-26 19:23:49,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-26 19:23:49,511 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 19:23:49,512 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 101 flow [2023-08-26 19:23:49,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:49,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:49,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 19:23:49,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:49,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash -847838367, now seen corresponding path program 1 times [2023-08-26 19:23:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:49,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904309361] [2023-08-26 19:23:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:49,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:49,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904309361] [2023-08-26 19:23:49,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904309361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:49,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:49,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 19:23:49,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031146680] [2023-08-26 19:23:49,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:49,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 19:23:49,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:49,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 19:23:49,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-08-26 19:23:49,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 352 [2023-08-26 19:23:49,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 101 flow. Second operand has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:49,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 352 [2023-08-26 19:23:49,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:49,815 INFO L124 PetriNetUnfolderBase]: 2121/2564 cut-off events. [2023-08-26 19:23:49,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:49,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 2564 events. 2121/2564 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5937 event pairs, 1029 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 5201. Up to 2564 conditions per place. [2023-08-26 19:23:49,823 INFO L140 encePairwiseOnDemand]: 350/352 looper letters, 37 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-08-26 19:23:49,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 38 transitions, 175 flow [2023-08-26 19:23:49,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-26 19:23:49,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2023-08-26 19:23:49,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-26 19:23:49,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-26 19:23:49,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:49,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-26 19:23:49,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,827 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 101 flow. Second operand 3 states and 384 transitions. [2023-08-26 19:23:49,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 38 transitions, 175 flow [2023-08-26 19:23:49,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 38 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:49,828 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 100 flow [2023-08-26 19:23:49,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-26 19:23:49,828 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 19:23:49,828 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 100 flow [2023-08-26 19:23:49,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:49,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:49,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:49,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 19:23:49,829 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:49,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -847838366, now seen corresponding path program 1 times [2023-08-26 19:23:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:49,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918089330] [2023-08-26 19:23:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:50,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:50,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918089330] [2023-08-26 19:23:50,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918089330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:50,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:50,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:23:50,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427024291] [2023-08-26 19:23:50,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:50,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:23:50,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:50,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:23:50,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:23:50,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 352 [2023-08-26 19:23:50,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:50,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 352 [2023-08-26 19:23:50,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:50,204 INFO L124 PetriNetUnfolderBase]: 1737/2116 cut-off events. [2023-08-26 19:23:50,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:23:50,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 2116 events. 1737/2116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4760 event pairs, 837 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 4306. Up to 2116 conditions per place. [2023-08-26 19:23:50,211 INFO L140 encePairwiseOnDemand]: 350/352 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 19:23:50,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 172 flow [2023-08-26 19:23:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-26 19:23:50,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3768939393939394 [2023-08-26 19:23:50,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-26 19:23:50,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-26 19:23:50,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:50,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-26 19:23:50,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,215 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 100 flow. Second operand 3 states and 398 transitions. [2023-08-26 19:23:50,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 172 flow [2023-08-26 19:23:50,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 37 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:50,216 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 99 flow [2023-08-26 19:23:50,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-26 19:23:50,216 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2023-08-26 19:23:50,216 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 99 flow [2023-08-26 19:23:50,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:50,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:50,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 19:23:50,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:50,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash 678367948, now seen corresponding path program 1 times [2023-08-26 19:23:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:50,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455995107] [2023-08-26 19:23:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:50,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455995107] [2023-08-26 19:23:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455995107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:50,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:23:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766005423] [2023-08-26 19:23:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:50,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:23:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:23:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:23:50,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 352 [2023-08-26 19:23:50,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:50,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 352 [2023-08-26 19:23:50,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:50,681 INFO L124 PetriNetUnfolderBase]: 3473/4229 cut-off events. [2023-08-26 19:23:50,681 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-26 19:23:50,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8599 conditions, 4229 events. 3473/4229 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11632 event pairs, 837 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 8595. Up to 3015 conditions per place. [2023-08-26 19:23:50,693 INFO L140 encePairwiseOnDemand]: 344/352 looper letters, 63 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2023-08-26 19:23:50,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 320 flow [2023-08-26 19:23:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:23:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:23:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-08-26 19:23:50,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-08-26 19:23:50,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-08-26 19:23:50,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-08-26 19:23:50,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:50,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-08-26 19:23:50,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,697 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 99 flow. Second operand 3 states and 495 transitions. [2023-08-26 19:23:50,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 320 flow [2023-08-26 19:23:50,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:50,698 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 145 flow [2023-08-26 19:23:50,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 19:23:50,699 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -20 predicate places. [2023-08-26 19:23:50,699 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 145 flow [2023-08-26 19:23:50,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:50,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:50,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 19:23:50,699 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:50,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1065283738, now seen corresponding path program 1 times [2023-08-26 19:23:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231774651] [2023-08-26 19:23:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:50,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:50,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231774651] [2023-08-26 19:23:50,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231774651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:50,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:50,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:23:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488593745] [2023-08-26 19:23:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:50,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:50,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:23:50,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:50,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:50,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:23:50,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:51,225 INFO L124 PetriNetUnfolderBase]: 5003/6125 cut-off events. [2023-08-26 19:23:51,225 INFO L125 PetriNetUnfolderBase]: For 2480/2480 co-relation queries the response was YES. [2023-08-26 19:23:51,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15761 conditions, 6125 events. 5003/6125 cut-off events. For 2480/2480 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19113 event pairs, 259 based on Foata normal form. 186/6311 useless extension candidates. Maximal degree in co-relation 15756. Up to 3157 conditions per place. [2023-08-26 19:23:51,246 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 116 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2023-08-26 19:23:51,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 126 transitions, 633 flow [2023-08-26 19:23:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 871 transitions. [2023-08-26 19:23:51,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4948863636363636 [2023-08-26 19:23:51,248 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 871 transitions. [2023-08-26 19:23:51,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 871 transitions. [2023-08-26 19:23:51,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:51,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 871 transitions. [2023-08-26 19:23:51,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:51,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:51,252 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:51,252 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 145 flow. Second operand 5 states and 871 transitions. [2023-08-26 19:23:51,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 126 transitions, 633 flow [2023-08-26 19:23:51,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:51,255 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 203 flow [2023-08-26 19:23:51,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-08-26 19:23:51,255 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -15 predicate places. [2023-08-26 19:23:51,255 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 203 flow [2023-08-26 19:23:51,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:51,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:51,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:51,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 19:23:51,256 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:51,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 163624692, now seen corresponding path program 1 times [2023-08-26 19:23:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208134153] [2023-08-26 19:23:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208134153] [2023-08-26 19:23:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208134153] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904132681] [2023-08-26 19:23:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:51,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:51,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:51,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 19:23:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:51,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:23:51,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:51,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904132681] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:51,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:51,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:23:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279714890] [2023-08-26 19:23:51,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:51,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:23:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:51,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:23:51,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:23:51,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:23:51,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:51,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:51,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:23:51,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:52,451 INFO L124 PetriNetUnfolderBase]: 11091/13597 cut-off events. [2023-08-26 19:23:52,452 INFO L125 PetriNetUnfolderBase]: For 11277/11277 co-relation queries the response was YES. [2023-08-26 19:23:52,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38624 conditions, 13597 events. 11091/13597 cut-off events. For 11277/11277 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 47476 event pairs, 2521 based on Foata normal form. 336/13933 useless extension candidates. Maximal degree in co-relation 38617. Up to 5767 conditions per place. [2023-08-26 19:23:52,514 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 139 selfloop transitions, 8 changer transitions 0/147 dead transitions. [2023-08-26 19:23:52,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 147 transitions, 862 flow [2023-08-26 19:23:52,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2023-08-26 19:23:52,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960227272727273 [2023-08-26 19:23:52,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 873 transitions. [2023-08-26 19:23:52,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 873 transitions. [2023-08-26 19:23:52,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:52,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 873 transitions. [2023-08-26 19:23:52,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:52,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:52,520 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:52,520 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 203 flow. Second operand 5 states and 873 transitions. [2023-08-26 19:23:52,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 147 transitions, 862 flow [2023-08-26 19:23:52,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 147 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:23:52,524 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 258 flow [2023-08-26 19:23:52,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-08-26 19:23:52,525 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-08-26 19:23:52,525 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 258 flow [2023-08-26 19:23:52,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:52,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:52,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:52,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 19:23:52,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-26 19:23:52,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:52,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash -324494866, now seen corresponding path program 2 times [2023-08-26 19:23:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806380110] [2023-08-26 19:23:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:52,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:52,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806380110] [2023-08-26 19:23:52,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806380110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:52,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:52,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:23:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474773492] [2023-08-26 19:23:52,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:52,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:52,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:52,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:52,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:23:52,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:52,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:52,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:23:52,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:53,449 INFO L124 PetriNetUnfolderBase]: 9551/11693 cut-off events. [2023-08-26 19:23:53,449 INFO L125 PetriNetUnfolderBase]: For 14895/14895 co-relation queries the response was YES. [2023-08-26 19:23:53,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38915 conditions, 11693 events. 9551/11693 cut-off events. For 14895/14895 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 40789 event pairs, 415 based on Foata normal form. 232/11925 useless extension candidates. Maximal degree in co-relation 38904. Up to 4869 conditions per place. [2023-08-26 19:23:53,507 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 140 selfloop transitions, 11 changer transitions 0/151 dead transitions. [2023-08-26 19:23:53,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 151 transitions, 957 flow [2023-08-26 19:23:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2023-08-26 19:23:53,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49261363636363636 [2023-08-26 19:23:53,510 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2023-08-26 19:23:53,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2023-08-26 19:23:53,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:53,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2023-08-26 19:23:53,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,514 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,514 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 258 flow. Second operand 5 states and 867 transitions. [2023-08-26 19:23:53,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 151 transitions, 957 flow [2023-08-26 19:23:53,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 151 transitions, 957 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:23:53,570 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 319 flow [2023-08-26 19:23:53,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2023-08-26 19:23:53,570 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-08-26 19:23:53,571 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 319 flow [2023-08-26 19:23:53,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:53,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:53,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 19:23:53,571 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:53,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -752801965, now seen corresponding path program 1 times [2023-08-26 19:23:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:53,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580625424] [2023-08-26 19:23:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:53,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:53,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580625424] [2023-08-26 19:23:53,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580625424] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:53,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010582428] [2023-08-26 19:23:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:53,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:53,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:53,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:53,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 19:23:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:53,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:23:53,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:53,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:53,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010582428] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:53,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:53,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:23:53,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941626932] [2023-08-26 19:23:53,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:53,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:23:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:53,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:23:53,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:23:53,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 19:23:53,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:53,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:53,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 19:23:53,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:55,524 INFO L124 PetriNetUnfolderBase]: 20683/25339 cut-off events. [2023-08-26 19:23:55,524 INFO L125 PetriNetUnfolderBase]: For 44742/44742 co-relation queries the response was YES. [2023-08-26 19:23:55,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91079 conditions, 25339 events. 20683/25339 cut-off events. For 44742/44742 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 98290 event pairs, 1367 based on Foata normal form. 624/25963 useless extension candidates. Maximal degree in co-relation 91066. Up to 11082 conditions per place. [2023-08-26 19:23:55,660 INFO L140 encePairwiseOnDemand]: 343/352 looper letters, 193 selfloop transitions, 14 changer transitions 1/208 dead transitions. [2023-08-26 19:23:55,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 208 transitions, 1453 flow [2023-08-26 19:23:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:23:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:23:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2023-08-26 19:23:55,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630681818181818 [2023-08-26 19:23:55,662 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 978 transitions. [2023-08-26 19:23:55,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 978 transitions. [2023-08-26 19:23:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:55,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 978 transitions. [2023-08-26 19:23:55,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:55,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:55,676 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:55,676 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 319 flow. Second operand 6 states and 978 transitions. [2023-08-26 19:23:55,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 208 transitions, 1453 flow [2023-08-26 19:23:55,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 208 transitions, 1407 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:55,751 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 376 flow [2023-08-26 19:23:55,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2023-08-26 19:23:55,752 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-08-26 19:23:55,752 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 376 flow [2023-08-26 19:23:55,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 148.0) internal successors, (1036), 7 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:55,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:55,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:55,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-26 19:23:55,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 19:23:55,958 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:55,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:55,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2113580401, now seen corresponding path program 2 times [2023-08-26 19:23:55,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:55,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692938927] [2023-08-26 19:23:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:56,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:56,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692938927] [2023-08-26 19:23:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692938927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:56,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:23:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924608286] [2023-08-26 19:23:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:56,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:56,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:56,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:23:56,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:56,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:56,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:23:56,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:57,508 INFO L124 PetriNetUnfolderBase]: 18095/22119 cut-off events. [2023-08-26 19:23:57,508 INFO L125 PetriNetUnfolderBase]: For 49533/49533 co-relation queries the response was YES. [2023-08-26 19:23:57,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88475 conditions, 22119 events. 18095/22119 cut-off events. For 49533/49533 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 82287 event pairs, 1095 based on Foata normal form. 308/22427 useless extension candidates. Maximal degree in co-relation 88458. Up to 9558 conditions per place. [2023-08-26 19:23:57,604 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 174 selfloop transitions, 11 changer transitions 0/185 dead transitions. [2023-08-26 19:23:57,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 185 transitions, 1406 flow [2023-08-26 19:23:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2023-08-26 19:23:57,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4903409090909091 [2023-08-26 19:23:57,607 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 863 transitions. [2023-08-26 19:23:57,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 863 transitions. [2023-08-26 19:23:57,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:57,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 863 transitions. [2023-08-26 19:23:57,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:57,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:57,610 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:57,610 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 376 flow. Second operand 5 states and 863 transitions. [2023-08-26 19:23:57,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 185 transitions, 1406 flow [2023-08-26 19:23:57,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 185 transitions, 1390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:23:57,755 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 426 flow [2023-08-26 19:23:57,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=426, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2023-08-26 19:23:57,755 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-08-26 19:23:57,755 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 426 flow [2023-08-26 19:23:57,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:57,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:57,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:57,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 19:23:57,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:57,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:57,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1745869060, now seen corresponding path program 1 times [2023-08-26 19:23:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:57,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103559269] [2023-08-26 19:23:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:57,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103559269] [2023-08-26 19:23:57,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103559269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:23:57,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:23:57,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:23:57,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512467969] [2023-08-26 19:23:57,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:23:57,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:23:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:57,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:23:57,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:23:57,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:23:57,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 426 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:57,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:57,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:23:57,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:23:59,312 INFO L124 PetriNetUnfolderBase]: 17695/21719 cut-off events. [2023-08-26 19:23:59,313 INFO L125 PetriNetUnfolderBase]: For 54496/54496 co-relation queries the response was YES. [2023-08-26 19:23:59,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91741 conditions, 21719 events. 17695/21719 cut-off events. For 54496/54496 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 84388 event pairs, 787 based on Foata normal form. 400/22119 useless extension candidates. Maximal degree in co-relation 91722. Up to 9597 conditions per place. [2023-08-26 19:23:59,410 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 179 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-08-26 19:23:59,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 187 transitions, 1439 flow [2023-08-26 19:23:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:23:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:23:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2023-08-26 19:23:59,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49204545454545456 [2023-08-26 19:23:59,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 866 transitions. [2023-08-26 19:23:59,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 866 transitions. [2023-08-26 19:23:59,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:23:59,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 866 transitions. [2023-08-26 19:23:59,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:59,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:59,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:59,416 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 426 flow. Second operand 5 states and 866 transitions. [2023-08-26 19:23:59,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 187 transitions, 1439 flow [2023-08-26 19:23:59,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 187 transitions, 1415 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-26 19:23:59,535 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 434 flow [2023-08-26 19:23:59,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2023-08-26 19:23:59,535 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 13 predicate places. [2023-08-26 19:23:59,535 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 434 flow [2023-08-26 19:23:59,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:59,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:23:59,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:23:59,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 19:23:59,536 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:23:59,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:23:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1630973843, now seen corresponding path program 1 times [2023-08-26 19:23:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:23:59,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421267950] [2023-08-26 19:23:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:23:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:23:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421267950] [2023-08-26 19:23:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421267950] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:23:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241429857] [2023-08-26 19:23:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:23:59,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:23:59,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:23:59,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:23:59,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 19:23:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:23:59,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:23:59,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:23:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:59,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:23:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:23:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241429857] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:23:59,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:23:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:23:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843206204] [2023-08-26 19:23:59,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:23:59,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:23:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:23:59,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:23:59,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:23:59,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:23:59,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 157.66666666666666) internal successors, (946), 6 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:23:59,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:23:59,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:23:59,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:24:02,018 INFO L124 PetriNetUnfolderBase]: 25973/32005 cut-off events. [2023-08-26 19:24:02,018 INFO L125 PetriNetUnfolderBase]: For 101517/101517 co-relation queries the response was YES. [2023-08-26 19:24:02,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139468 conditions, 32005 events. 25973/32005 cut-off events. For 101517/101517 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 127240 event pairs, 6937 based on Foata normal form. 820/32825 useless extension candidates. Maximal degree in co-relation 139448. Up to 13990 conditions per place. [2023-08-26 19:24:02,197 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 197 selfloop transitions, 10 changer transitions 0/207 dead transitions. [2023-08-26 19:24:02,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 207 transitions, 1620 flow [2023-08-26 19:24:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:24:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:24:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 881 transitions. [2023-08-26 19:24:02,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005681818181819 [2023-08-26 19:24:02,200 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 881 transitions. [2023-08-26 19:24:02,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 881 transitions. [2023-08-26 19:24:02,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:24:02,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 881 transitions. [2023-08-26 19:24:02,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.2) internal successors, (881), 5 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:02,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:02,203 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:02,203 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 434 flow. Second operand 5 states and 881 transitions. [2023-08-26 19:24:02,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 207 transitions, 1620 flow [2023-08-26 19:24:02,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 207 transitions, 1585 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 19:24:02,359 INFO L231 Difference]: Finished difference. Result has 92 places, 72 transitions, 479 flow [2023-08-26 19:24:02,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=479, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2023-08-26 19:24:02,359 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 18 predicate places. [2023-08-26 19:24:02,359 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 479 flow [2023-08-26 19:24:02,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.66666666666666) internal successors, (946), 6 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:02,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:24:02,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:24:02,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 19:24:02,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:24:02,564 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:24:02,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:24:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash -839922172, now seen corresponding path program 1 times [2023-08-26 19:24:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:24:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484619839] [2023-08-26 19:24:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:24:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:24:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:24:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:24:02,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:24:02,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484619839] [2023-08-26 19:24:02,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484619839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:24:02,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:24:02,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:24:02,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656792963] [2023-08-26 19:24:02,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:24:02,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:24:02,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:24:02,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:24:02,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:24:02,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:24:02,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 72 transitions, 479 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:02,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:24:02,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:24:02,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:24:04,696 INFO L124 PetriNetUnfolderBase]: 25499/31531 cut-off events. [2023-08-26 19:24:04,696 INFO L125 PetriNetUnfolderBase]: For 101643/101643 co-relation queries the response was YES. [2023-08-26 19:24:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142157 conditions, 31531 events. 25499/31531 cut-off events. For 101643/101643 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 129012 event pairs, 1643 based on Foata normal form. 474/32005 useless extension candidates. Maximal degree in co-relation 142134. Up to 14061 conditions per place. [2023-08-26 19:24:04,887 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 185 selfloop transitions, 8 changer transitions 0/193 dead transitions. [2023-08-26 19:24:04,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 193 transitions, 1639 flow [2023-08-26 19:24:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:24:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:24:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2023-08-26 19:24:04,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48977272727272725 [2023-08-26 19:24:04,889 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2023-08-26 19:24:04,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2023-08-26 19:24:04,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:24:04,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2023-08-26 19:24:04,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:04,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:04,893 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:04,893 INFO L175 Difference]: Start difference. First operand has 92 places, 72 transitions, 479 flow. Second operand 5 states and 862 transitions. [2023-08-26 19:24:04,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 193 transitions, 1639 flow [2023-08-26 19:24:05,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 193 transitions, 1604 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 19:24:05,250 INFO L231 Difference]: Finished difference. Result has 96 places, 71 transitions, 484 flow [2023-08-26 19:24:05,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=484, PETRI_PLACES=96, PETRI_TRANSITIONS=71} [2023-08-26 19:24:05,250 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-08-26 19:24:05,250 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 484 flow [2023-08-26 19:24:05,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:05,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:24:05,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:24:05,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 19:24:05,251 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:24:05,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:24:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1825113832, now seen corresponding path program 2 times [2023-08-26 19:24:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:24:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760511916] [2023-08-26 19:24:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:24:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:24:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:24:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:24:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:24:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760511916] [2023-08-26 19:24:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760511916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:24:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:24:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:24:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873069413] [2023-08-26 19:24:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:24:05,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:24:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:24:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:24:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:24:05,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:24:05,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 71 transitions, 484 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:05,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:24:05,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:24:05,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:24:07,757 INFO L124 PetriNetUnfolderBase]: 29667/36623 cut-off events. [2023-08-26 19:24:07,757 INFO L125 PetriNetUnfolderBase]: For 121024/121024 co-relation queries the response was YES. [2023-08-26 19:24:07,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168719 conditions, 36623 events. 29667/36623 cut-off events. For 121024/121024 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 148882 event pairs, 5405 based on Foata normal form. 924/37547 useless extension candidates. Maximal degree in co-relation 168695. Up to 19651 conditions per place. [2023-08-26 19:24:07,996 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 178 selfloop transitions, 8 changer transitions 0/186 dead transitions. [2023-08-26 19:24:07,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 186 transitions, 1562 flow [2023-08-26 19:24:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:24:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:24:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 859 transitions. [2023-08-26 19:24:07,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48806818181818185 [2023-08-26 19:24:07,999 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 859 transitions. [2023-08-26 19:24:07,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 859 transitions. [2023-08-26 19:24:07,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:24:07,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 859 transitions. [2023-08-26 19:24:08,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:08,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:08,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:08,002 INFO L175 Difference]: Start difference. First operand has 96 places, 71 transitions, 484 flow. Second operand 5 states and 859 transitions. [2023-08-26 19:24:08,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 186 transitions, 1562 flow [2023-08-26 19:24:08,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 186 transitions, 1549 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 19:24:08,389 INFO L231 Difference]: Finished difference. Result has 101 places, 74 transitions, 524 flow [2023-08-26 19:24:08,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=524, PETRI_PLACES=101, PETRI_TRANSITIONS=74} [2023-08-26 19:24:08,389 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 27 predicate places. [2023-08-26 19:24:08,389 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 74 transitions, 524 flow [2023-08-26 19:24:08,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:08,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:24:08,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:24:08,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 19:24:08,390 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:24:08,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:24:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1074145072, now seen corresponding path program 2 times [2023-08-26 19:24:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:24:08,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907791913] [2023-08-26 19:24:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:24:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:24:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:24:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:24:08,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:24:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907791913] [2023-08-26 19:24:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907791913] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:24:08,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:24:08,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:24:08,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023329722] [2023-08-26 19:24:08,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:24:08,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:24:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:24:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:24:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:24:08,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:24:08,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 74 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:08,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:24:08,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:24:08,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:24:11,395 INFO L124 PetriNetUnfolderBase]: 35535/43739 cut-off events. [2023-08-26 19:24:11,395 INFO L125 PetriNetUnfolderBase]: For 154806/154806 co-relation queries the response was YES. [2023-08-26 19:24:11,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208172 conditions, 43739 events. 35535/43739 cut-off events. For 154806/154806 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 184072 event pairs, 6259 based on Foata normal form. 1248/44987 useless extension candidates. Maximal degree in co-relation 208145. Up to 24523 conditions per place. [2023-08-26 19:24:11,892 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 194 selfloop transitions, 8 changer transitions 0/202 dead transitions. [2023-08-26 19:24:11,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 202 transitions, 1780 flow [2023-08-26 19:24:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:24:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:24:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2023-08-26 19:24:11,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4903409090909091 [2023-08-26 19:24:11,895 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 863 transitions. [2023-08-26 19:24:11,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 863 transitions. [2023-08-26 19:24:11,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:24:11,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 863 transitions. [2023-08-26 19:24:11,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:11,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:11,898 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:11,898 INFO L175 Difference]: Start difference. First operand has 101 places, 74 transitions, 524 flow. Second operand 5 states and 863 transitions. [2023-08-26 19:24:11,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 202 transitions, 1780 flow [2023-08-26 19:24:12,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 202 transitions, 1700 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-26 19:24:12,472 INFO L231 Difference]: Finished difference. Result has 105 places, 77 transitions, 549 flow [2023-08-26 19:24:12,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=105, PETRI_TRANSITIONS=77} [2023-08-26 19:24:12,472 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 31 predicate places. [2023-08-26 19:24:12,472 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 77 transitions, 549 flow [2023-08-26 19:24:12,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:12,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:24:12,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:24:12,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 19:24:12,473 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:24:12,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:24:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1736590159, now seen corresponding path program 2 times [2023-08-26 19:24:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:24:12,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632084364] [2023-08-26 19:24:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:24:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:24:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:24:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:24:12,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:24:12,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632084364] [2023-08-26 19:24:12,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632084364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:24:12,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:24:12,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:24:12,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397448374] [2023-08-26 19:24:12,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:24:12,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:24:12,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:24:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:24:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:24:12,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 19:24:12,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 77 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:12,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:24:12,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 19:24:12,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:24:15,715 INFO L124 PetriNetUnfolderBase]: 34839/42825 cut-off events. [2023-08-26 19:24:15,715 INFO L125 PetriNetUnfolderBase]: For 159454/159454 co-relation queries the response was YES. [2023-08-26 19:24:15,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207747 conditions, 42825 events. 34839/42825 cut-off events. For 159454/159454 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 177405 event pairs, 7415 based on Foata normal form. 62/42887 useless extension candidates. Maximal degree in co-relation 207718. Up to 41611 conditions per place. [2023-08-26 19:24:16,028 INFO L140 encePairwiseOnDemand]: 343/352 looper letters, 117 selfloop transitions, 13 changer transitions 3/133 dead transitions. [2023-08-26 19:24:16,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 133 transitions, 1067 flow [2023-08-26 19:24:16,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:24:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:24:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2023-08-26 19:24:16,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2023-08-26 19:24:16,030 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 649 transitions. [2023-08-26 19:24:16,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 649 transitions. [2023-08-26 19:24:16,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:24:16,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 649 transitions. [2023-08-26 19:24:16,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:16,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:16,033 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:16,033 INFO L175 Difference]: Start difference. First operand has 105 places, 77 transitions, 549 flow. Second operand 4 states and 649 transitions. [2023-08-26 19:24:16,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 133 transitions, 1067 flow [2023-08-26 19:24:16,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 133 transitions, 1039 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 19:24:16,860 INFO L231 Difference]: Finished difference. Result has 107 places, 82 transitions, 616 flow [2023-08-26 19:24:16,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=616, PETRI_PLACES=107, PETRI_TRANSITIONS=82} [2023-08-26 19:24:16,861 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 33 predicate places. [2023-08-26 19:24:16,861 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 82 transitions, 616 flow [2023-08-26 19:24:16,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:16,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:24:16,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:24:16,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 19:24:16,861 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:24:16,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:24:16,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1164287376, now seen corresponding path program 2 times [2023-08-26 19:24:16,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:24:16,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160169516] [2023-08-26 19:24:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:24:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:24:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:24:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:24:16,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:24:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160169516] [2023-08-26 19:24:16,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160169516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:24:16,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:24:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:24:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735778252] [2023-08-26 19:24:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:24:16,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:24:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:24:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:24:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:24:16,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2023-08-26 19:24:16,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 82 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:16,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:24:16,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2023-08-26 19:24:16,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:24:20,383 INFO L124 PetriNetUnfolderBase]: 38983/47805 cut-off events. [2023-08-26 19:24:20,383 INFO L125 PetriNetUnfolderBase]: For 176150/176150 co-relation queries the response was YES. [2023-08-26 19:24:20,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226894 conditions, 47805 events. 38983/47805 cut-off events. For 176150/176150 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 195901 event pairs, 10351 based on Foata normal form. 836/48641 useless extension candidates. Maximal degree in co-relation 226864. Up to 30013 conditions per place. [2023-08-26 19:24:20,776 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 215 selfloop transitions, 9 changer transitions 0/224 dead transitions. [2023-08-26 19:24:20,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 224 transitions, 1957 flow [2023-08-26 19:24:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:24:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:24:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2023-08-26 19:24:20,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49261363636363636 [2023-08-26 19:24:20,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2023-08-26 19:24:20,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2023-08-26 19:24:20,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:24:20,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2023-08-26 19:24:20,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:20,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:20,784 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:20,784 INFO L175 Difference]: Start difference. First operand has 107 places, 82 transitions, 616 flow. Second operand 5 states and 867 transitions. [2023-08-26 19:24:20,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 224 transitions, 1957 flow [2023-08-26 19:24:21,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 224 transitions, 1935 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:24:21,242 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 650 flow [2023-08-26 19:24:21,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=650, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2023-08-26 19:24:21,243 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 37 predicate places. [2023-08-26 19:24:21,243 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 650 flow [2023-08-26 19:24:21,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:24:21,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:24:21,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:24:21,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 19:24:21,243 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:24:21,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:24:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash -790891101, now seen corresponding path program 1 times [2023-08-26 19:24:21,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:24:21,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713066784] [2023-08-26 19:24:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:24:21,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:24:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:24:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:24:21,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:24:21,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713066784] [2023-08-26 19:24:21,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713066784] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:24:21,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575856731] [2023-08-26 19:24:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:24:21,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:24:21,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:24:21,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:24:21,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 19:24:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:24:22,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:24:22,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:24:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:24:52,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:25:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:25:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575856731] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:25:06,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:25:06,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-26 19:25:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804157497] [2023-08-26 19:25:06,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:25:06,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 19:25:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:25:06,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 19:25:06,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=146, Unknown=12, NotChecked=0, Total=210 [2023-08-26 19:25:06,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 19:25:06,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 650 flow. Second operand has 15 states, 15 states have (on average 144.86666666666667) internal successors, (2173), 15 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:25:06,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:25:06,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 19:25:06,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:25:11,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:14,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:17,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:20,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:21,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:25,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:29,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:31,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:39,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:42,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:51,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:07,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:13,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:19,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:32,201 INFO L124 PetriNetUnfolderBase]: 61165/75831 cut-off events. [2023-08-26 19:26:32,201 INFO L125 PetriNetUnfolderBase]: For 288305/288305 co-relation queries the response was YES. [2023-08-26 19:26:32,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370676 conditions, 75831 events. 61165/75831 cut-off events. For 288305/288305 co-relation queries the response was YES. Maximal size of possible extension queue 1728. Compared 346073 event pairs, 8808 based on Foata normal form. 194/76025 useless extension candidates. Maximal degree in co-relation 370644. Up to 54139 conditions per place. [2023-08-26 19:26:33,139 INFO L140 encePairwiseOnDemand]: 342/352 looper letters, 468 selfloop transitions, 243 changer transitions 20/731 dead transitions. [2023-08-26 19:26:33,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 731 transitions, 6257 flow [2023-08-26 19:26:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 19:26:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 19:26:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3085 transitions. [2023-08-26 19:26:33,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612739234449761 [2023-08-26 19:26:33,143 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3085 transitions. [2023-08-26 19:26:33,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3085 transitions. [2023-08-26 19:26:33,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:26:33,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3085 transitions. [2023-08-26 19:26:33,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 162.3684210526316) internal successors, (3085), 19 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:26:33,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 352.0) internal successors, (7040), 20 states have internal predecessors, (7040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:26:33,151 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 352.0) internal successors, (7040), 20 states have internal predecessors, (7040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:26:33,151 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 650 flow. Second operand 19 states and 3085 transitions. [2023-08-26 19:26:33,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 731 transitions, 6257 flow [2023-08-26 19:26:35,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 731 transitions, 6083 flow, removed 60 selfloop flow, removed 1 redundant places. [2023-08-26 19:26:35,167 INFO L231 Difference]: Finished difference. Result has 142 places, 320 transitions, 3483 flow [2023-08-26 19:26:35,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3483, PETRI_PLACES=142, PETRI_TRANSITIONS=320} [2023-08-26 19:26:35,167 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 68 predicate places. [2023-08-26 19:26:35,167 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 320 transitions, 3483 flow [2023-08-26 19:26:35,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 144.86666666666667) internal successors, (2173), 15 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:26:35,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:26:35,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:26:35,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 19:26:35,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 19:26:35,373 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:26:35,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:26:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1753687709, now seen corresponding path program 1 times [2023-08-26 19:26:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:26:35,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117654424] [2023-08-26 19:26:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:26:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:26:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:26:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:26:35,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:26:35,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117654424] [2023-08-26 19:26:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117654424] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:26:35,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121611827] [2023-08-26 19:26:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:26:35,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:26:35,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:26:35,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:26:35,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 19:26:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:26:36,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:26:36,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:27:22,483 WARN L234 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:27:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:27:28,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:27:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:27:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121611827] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:27:54,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:27:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 19:27:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487974675] [2023-08-26 19:27:54,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:27:54,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 19:27:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:27:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 19:27:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=163, Unknown=27, NotChecked=0, Total=240 [2023-08-26 19:27:54,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 19:27:54,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 320 transitions, 3483 flow. Second operand has 16 states, 16 states have (on average 144.4375) internal successors, (2311), 16 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:27:54,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:27:54,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 19:27:54,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:27:56,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:27,023 WARN L234 SmtUtils]: Spent 1.43m on a formula simplification. DAG size of input: 96 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:29:30,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:31,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:35,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:37,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:29:55,108 WARN L234 SmtUtils]: Spent 14.01s on a formula simplification. DAG size of input: 80 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:29:57,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:03,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:05,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:08,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:09,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:11,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:13,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:15,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:17,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:19,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:21,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:23,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:18,531 WARN L234 SmtUtils]: Spent 37.90s on a formula simplification. DAG size of input: 69 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:31:20,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:23,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:26,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:28,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:31,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:33,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:35,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:37,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:39,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:41,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:43,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:45,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:47,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:49,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:51,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:53,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:55,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:57,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:59,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:01,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:03,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:12,923 WARN L234 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 44 DAG size of output: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:32:15,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:17,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:19,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:24,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:26,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:28,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:30,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:32,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:34,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:36,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:38,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:40,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:41,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:44,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:46,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:48,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:50,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:52,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:54,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:57,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:32:59,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:01,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:03,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:05,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:07,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:11,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:12,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:15,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:17,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:19,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:21,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:23,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:25,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:27,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:30,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:35,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:37,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:39,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:41,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:43,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:45,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:47,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:49,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:51,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:52,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:54,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:56,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:33:58,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:00,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:02,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:04,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:06,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:10,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:12,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:14,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:16,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:18,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:21,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:23,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:25,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:27,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:29,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:31,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:33,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:34,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:41,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:43,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:45,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:46,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:48,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:50,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:52,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:54,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:56,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:34:58,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:00,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:02,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:09,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:11,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:13,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:15,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:17,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:19,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:21,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:24,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:25,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:29,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:32,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:34,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:36,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:38,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:40,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:42,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:44,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:46,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:48,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:50,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:52,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:54,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:56,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:35:58,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:01,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:04,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:06,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:08,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:10,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:12,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:14,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:16,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:18,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:21,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:23,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:25,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:27,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:29,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:31,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:33,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:36:42,180 INFO L124 PetriNetUnfolderBase]: 71769/89063 cut-off events. [2023-08-26 19:36:42,180 INFO L125 PetriNetUnfolderBase]: For 510258/510258 co-relation queries the response was YES. [2023-08-26 19:36:43,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508744 conditions, 89063 events. 71769/89063 cut-off events. For 510258/510258 co-relation queries the response was YES. Maximal size of possible extension queue 2067. Compared 416793 event pairs, 7789 based on Foata normal form. 2/89065 useless extension candidates. Maximal degree in co-relation 508697. Up to 78677 conditions per place. [2023-08-26 19:36:43,944 INFO L140 encePairwiseOnDemand]: 342/352 looper letters, 597 selfloop transitions, 138 changer transitions 7/742 dead transitions. [2023-08-26 19:36:43,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 742 transitions, 7621 flow [2023-08-26 19:36:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 19:36:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 19:36:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2280 transitions. [2023-08-26 19:36:43,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46266233766233766 [2023-08-26 19:36:43,949 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2280 transitions. [2023-08-26 19:36:43,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2280 transitions. [2023-08-26 19:36:43,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:36:43,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2280 transitions. [2023-08-26 19:36:43,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 162.85714285714286) internal successors, (2280), 14 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:36:43,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 352.0) internal successors, (5280), 15 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:36:43,956 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 352.0) internal successors, (5280), 15 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:36:43,956 INFO L175 Difference]: Start difference. First operand has 142 places, 320 transitions, 3483 flow. Second operand 14 states and 2280 transitions. [2023-08-26 19:36:43,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 742 transitions, 7621 flow [2023-08-26 19:36:48,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 742 transitions, 7332 flow, removed 139 selfloop flow, removed 1 redundant places. [2023-08-26 19:36:48,961 INFO L231 Difference]: Finished difference. Result has 160 places, 449 transitions, 4942 flow [2023-08-26 19:36:48,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=3194, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4942, PETRI_PLACES=160, PETRI_TRANSITIONS=449} [2023-08-26 19:36:48,962 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 86 predicate places. [2023-08-26 19:36:48,962 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 449 transitions, 4942 flow [2023-08-26 19:36:48,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 144.4375) internal successors, (2311), 16 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:36:48,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:36:48,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:36:48,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 19:36:49,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-26 19:36:49,166 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 19:36:49,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:36:49,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1290985927, now seen corresponding path program 2 times [2023-08-26 19:36:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:36:49,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601673542] [2023-08-26 19:36:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:36:49,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:36:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:36:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:36:49,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:36:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601673542] [2023-08-26 19:36:49,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601673542] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:36:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812273828] [2023-08-26 19:36:49,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:36:49,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:36:49,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:36:49,655 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:36:49,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 19:36:49,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:36:49,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:36:49,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:36:49,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:37:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:37:31,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:37:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:37:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812273828] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:37:54,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:37:54,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 19:37:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836782250] [2023-08-26 19:37:54,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:37:54,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 19:37:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:37:54,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 19:37:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=159, Unknown=27, NotChecked=0, Total=240 [2023-08-26 19:37:54,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 352 [2023-08-26 19:37:54,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 449 transitions, 4942 flow. Second operand has 16 states, 16 states have (on average 144.9375) internal successors, (2319), 16 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:37:54,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:37:54,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 352 [2023-08-26 19:37:54,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-26 19:38:01,910 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:38:01,947 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:38:02,829 WARN L266 SmtUtils]: Removed 8 from assertion stack [2023-08-26 19:38:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:38:02,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (30 of 31 remaining) [2023-08-26 19:38:02,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 19:38:02,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2023-08-26 19:38:03,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-26 19:38:03,031 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-08-26 19:38:03,033 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 31 remaining) [2023-08-26 19:38:03,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 31 remaining) [2023-08-26 19:38:03,035 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:38:03,037 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:38:03,037 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:38:03,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:38:03 BasicIcfg [2023-08-26 19:38:03,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:38:03,039 INFO L158 Benchmark]: Toolchain (without parser) took 864473.75ms. Allocated memory was 379.6MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 356.8MB in the beginning and 3.2GB in the end (delta: -2.9GB). Peak memory consumption was 10.5GB. Max. memory is 16.0GB. [2023-08-26 19:38:03,039 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 379.6MB. Free memory was 356.6MB in the beginning and 356.5MB in the end (delta: 80.7kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:38:03,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.46ms. Allocated memory is still 379.6MB. Free memory was 356.8MB in the beginning and 345.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 19:38:03,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.46ms. Allocated memory is still 379.6MB. Free memory was 345.2MB in the beginning and 343.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:38:03,039 INFO L158 Benchmark]: Boogie Preprocessor took 31.21ms. Allocated memory is still 379.6MB. Free memory was 343.2MB in the beginning and 341.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:38:03,039 INFO L158 Benchmark]: RCFGBuilder took 476.07ms. Allocated memory is still 379.6MB. Free memory was 341.4MB in the beginning and 321.1MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 19:38:03,040 INFO L158 Benchmark]: TraceAbstraction took 863738.56ms. Allocated memory was 379.6MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 320.5MB in the beginning and 3.2GB in the end (delta: -2.9GB). Peak memory consumption was 10.4GB. Max. memory is 16.0GB. [2023-08-26 19:38:03,040 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 379.6MB. Free memory was 356.6MB in the beginning and 356.5MB in the end (delta: 80.7kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 180.46ms. Allocated memory is still 379.6MB. Free memory was 356.8MB in the beginning and 345.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.46ms. Allocated memory is still 379.6MB. Free memory was 345.2MB in the beginning and 343.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.21ms. Allocated memory is still 379.6MB. Free memory was 343.2MB in the beginning and 341.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 476.07ms. Allocated memory is still 379.6MB. Free memory was 341.4MB in the beginning and 321.1MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 863738.56ms. Allocated memory was 379.6MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 320.5MB in the beginning and 3.2GB in the end (delta: -2.9GB). Peak memory consumption was 10.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 176 PlacesBefore, 74 PlacesAfterwards, 171 TransitionsBefore, 61 TransitionsAfterwards, 3780 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 12 ConcurrentYvCompositions, 8 ChoiceCompositions, 158 TotalNumberOfCompositions, 4775 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4775, independent: 4775, independent conditional: 0, independent unconditional: 4775, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1930, independent: 1930, independent conditional: 0, independent unconditional: 1930, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4775, independent: 2845, independent conditional: 0, independent unconditional: 2845, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1930, unknown conditional: 0, unknown unconditional: 1930] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 96 for 4080ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 217 locations, 31 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 863.7s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 661.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 148 mSolverCounterUnknown, 2142 SdHoareTripleChecker+Valid, 403.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2142 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 401.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5710 IncrementalHoareTripleChecker+Invalid, 5967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 0 mSDtfsCounter, 5710 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 349 SyntacticMatches, 10 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 362.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4942occurred in iteration=28, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 192.5s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 960 ConstructedInterpolants, 0 QuantifiedInterpolants, 26453 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2181 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 41 InterpolantComputations, 23 PerfectInterpolantSequences, 9/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown