./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/mix001.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i ./goblint.2024-05-21_14-57-05.files/protection/mix001.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 19:03:24,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 19:03:24,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 19:03:24,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 19:03:24,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 19:03:24,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 19:03:24,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 19:03:24,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 19:03:24,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 19:03:24,888 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 19:03:24,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 19:03:24,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 19:03:24,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 19:03:24,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 19:03:24,890 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 19:03:24,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 19:03:24,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 19:03:24,891 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 19:03:24,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 19:03:24,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 19:03:24,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 19:03:24,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 19:03:24,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 19:03:24,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 19:03:24,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 19:03:24,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 19:03:24,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 19:03:24,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 19:03:24,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 19:03:24,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 19:03:24,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 19:03:24,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 19:03:24,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 19:03:24,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 19:03:24,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 19:03:24,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 19:03:24,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 19:03:24,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 19:03:24,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 19:03:24,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 19:03:24,897 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 19:03:24,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 19:03:24,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 19:03:24,897 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 19:03:25,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 19:03:25,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 19:03:25,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 19:03:25,144 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 19:03:25,145 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 19:03:25,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/mix001.oepc.yml/witness.yml [2024-06-03 19:03:25,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 19:03:25,342 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 19:03:25,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2024-06-03 19:03:26,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 19:03:26,594 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 19:03:26,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2024-06-03 19:03:26,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d88ebbcd/fe2bad90efeb40019064126fe2035130/FLAG30114f0ad [2024-06-03 19:03:26,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d88ebbcd/fe2bad90efeb40019064126fe2035130 [2024-06-03 19:03:26,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 19:03:26,621 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 19:03:26,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 19:03:26,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 19:03:26,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 19:03:26,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:03:25" (1/2) ... [2024-06-03 19:03:26,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc0ea27 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:03:26, skipping insertion in model container [2024-06-03 19:03:26,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:03:25" (1/2) ... [2024-06-03 19:03:26,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@19951241 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 07:03:26, skipping insertion in model container [2024-06-03 19:03:26,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 07:03:26" (2/2) ... [2024-06-03 19:03:26,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc0ea27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:26, skipping insertion in model container [2024-06-03 19:03:26,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 07:03:26" (2/2) ... [2024-06-03 19:03:26,631 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 19:03:26,705 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 19:03:26,707 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] (((((((((((((((((((((! multithreaded || z$r_buff1_thd0 == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-03 19:03:26,707 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] (((((((((((((((((((((! multithreaded || z$r_buff1_thd0 == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-03 19:03:26,707 INFO L97 edCorrectnessWitness]: Location invariant before [L870-L870] (((((((((((((((((((((! multithreaded || z$r_buff1_thd0 == (_Bool)0) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$flush_delayed == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) [2024-06-03 19:03:26,707 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 19:03:26,708 INFO L106 edCorrectnessWitness]: ghost_update [L865-L865] multithreaded = 1; [2024-06-03 19:03:26,742 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 19:03:27,053 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 19:03:27,066 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 19:03:27,171 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 19:03:27,269 INFO L206 MainTranslator]: Completed translation [2024-06-03 19:03:27,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27 WrapperNode [2024-06-03 19:03:27,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 19:03:27,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 19:03:27,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 19:03:27,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 19:03:27,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,366 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2024-06-03 19:03:27,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 19:03:27,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 19:03:27,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 19:03:27,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 19:03:27,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,411 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-03 19:03:27,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 19:03:27,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 19:03:27,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 19:03:27,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 19:03:27,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (1/1) ... [2024-06-03 19:03:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 19:03:27,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 19:03:27,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 19:03:27,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 19:03:27,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 19:03:27,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 19:03:27,530 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 19:03:27,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 19:03:27,530 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 19:03:27,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 19:03:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 19:03:27,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 19:03:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 19:03:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 19:03:27,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 19:03:27,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 19:03:27,533 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 19:03:27,664 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 19:03:27,666 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 19:03:27,996 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 19:03:27,996 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 19:03:28,241 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 19:03:28,242 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 19:03:28,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 07:03:28 BoogieIcfgContainer [2024-06-03 19:03:28,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 19:03:28,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 19:03:28,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 19:03:28,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 19:03:28,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 07:03:25" (1/4) ... [2024-06-03 19:03:28,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43413fd0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 07:03:28, skipping insertion in model container [2024-06-03 19:03:28,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 07:03:26" (2/4) ... [2024-06-03 19:03:28,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43413fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 07:03:28, skipping insertion in model container [2024-06-03 19:03:28,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 07:03:27" (3/4) ... [2024-06-03 19:03:28,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43413fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 07:03:28, skipping insertion in model container [2024-06-03 19:03:28,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 07:03:28" (4/4) ... [2024-06-03 19:03:28,247 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2024-06-03 19:03:28,265 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 19:03:28,265 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 19:03:28,266 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 19:03:28,319 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 19:03:28,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow [2024-06-03 19:03:28,380 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-06-03 19:03:28,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 19:03:28,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 19:03:28,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow [2024-06-03 19:03:28,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow [2024-06-03 19:03:28,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 19:03:28,405 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=LoopHeads, 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;@4fba023d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 19:03:28,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 19:03:28,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 19:03:28,411 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 19:03:28,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 19:03:28,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:28,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 19:03:28,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:28,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash 154931612, now seen corresponding path program 1 times [2024-06-03 19:03:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:28,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198801993] [2024-06-03 19:03:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:29,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:29,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198801993] [2024-06-03 19:03:29,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198801993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:29,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:29,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 19:03:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081626583] [2024-06-03 19:03:29,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:29,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 19:03:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:29,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 19:03:29,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 19:03:29,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-03 19:03:29,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-06-03 19:03:29,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:29,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-03 19:03:29,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:29,841 INFO L124 PetriNetUnfolderBase]: 1363/2134 cut-off events. [2024-06-03 19:03:29,841 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-03 19:03:29,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 2134 events. 1363/2134 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10821 event pairs, 964 based on Foata normal form. 1/2079 useless extension candidates. Maximal degree in co-relation 4245. Up to 2037 conditions per place. [2024-06-03 19:03:29,856 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-03 19:03:29,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 181 flow [2024-06-03 19:03:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 19:03:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 19:03:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-03 19:03:29,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-06-03 19:03:29,867 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 80 transitions. [2024-06-03 19:03:29,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 181 flow [2024-06-03 19:03:29,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 19:03:29,874 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow [2024-06-03 19:03:29,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-03 19:03:29,878 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-06-03 19:03:29,878 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow [2024-06-03 19:03:29,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-06-03 19:03:29,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:29,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:29,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 19:03:29,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:29,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1434532229, now seen corresponding path program 1 times [2024-06-03 19:03:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431704347] [2024-06-03 19:03:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:30,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431704347] [2024-06-03 19:03:30,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431704347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:30,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 19:03:30,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019262435] [2024-06-03 19:03:30,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:30,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 19:03:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 19:03:30,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 19:03:30,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-03 19:03:30,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2024-06-03 19:03:30,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:30,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-03 19:03:30,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:30,859 INFO L124 PetriNetUnfolderBase]: 1357/2135 cut-off events. [2024-06-03 19:03:30,859 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-06-03 19:03:30,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 2135 events. 1357/2135 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10830 event pairs, 840 based on Foata normal form. 3/2122 useless extension candidates. Maximal degree in co-relation 4789. Up to 2013 conditions per place. [2024-06-03 19:03:30,869 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 41 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-06-03 19:03:30,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 248 flow [2024-06-03 19:03:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 19:03:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 19:03:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-06-03 19:03:30,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2024-06-03 19:03:30,871 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 103 transitions. [2024-06-03 19:03:30,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 248 flow [2024-06-03 19:03:30,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 19:03:30,872 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow [2024-06-03 19:03:30,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-03 19:03:30,873 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-03 19:03:30,873 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow [2024-06-03 19:03:30,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2024-06-03 19:03:30,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:30,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:30,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 19:03:30,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:30,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1520824703, now seen corresponding path program 1 times [2024-06-03 19:03:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:30,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018172139] [2024-06-03 19:03:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:31,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018172139] [2024-06-03 19:03:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018172139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:31,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 19:03:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357682407] [2024-06-03 19:03:31,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:31,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 19:03:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:31,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 19:03:31,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-03 19:03:31,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-03 19:03:31,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-06-03 19:03:31,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:31,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-03 19:03:31,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:32,286 INFO L124 PetriNetUnfolderBase]: 1351/2142 cut-off events. [2024-06-03 19:03:32,286 INFO L125 PetriNetUnfolderBase]: For 1162/1162 co-relation queries the response was YES. [2024-06-03 19:03:32,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 2142 events. 1351/2142 cut-off events. For 1162/1162 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10944 event pairs, 716 based on Foata normal form. 3/2135 useless extension candidates. Maximal degree in co-relation 5320. Up to 1989 conditions per place. [2024-06-03 19:03:32,296 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 48 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-03 19:03:32,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 326 flow [2024-06-03 19:03:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 19:03:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 19:03:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-06-03 19:03:32,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2024-06-03 19:03:32,298 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 126 transitions. [2024-06-03 19:03:32,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 326 flow [2024-06-03 19:03:32,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-03 19:03:32,301 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 178 flow [2024-06-03 19:03:32,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-03 19:03:32,301 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-03 19:03:32,301 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow [2024-06-03 19:03:32,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-06-03 19:03:32,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:32,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:32,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 19:03:32,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:32,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1223611968, now seen corresponding path program 1 times [2024-06-03 19:03:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092089472] [2024-06-03 19:03:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:33,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:33,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092089472] [2024-06-03 19:03:33,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092089472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:33,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:33,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:03:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039879246] [2024-06-03 19:03:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:33,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:03:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:03:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:03:33,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-03 19:03:33,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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) [2024-06-03 19:03:33,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:33,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-03 19:03:33,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:34,242 INFO L124 PetriNetUnfolderBase]: 1586/2499 cut-off events. [2024-06-03 19:03:34,243 INFO L125 PetriNetUnfolderBase]: For 2479/2479 co-relation queries the response was YES. [2024-06-03 19:03:34,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 2499 events. 1586/2499 cut-off events. For 2479/2479 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12821 event pairs, 667 based on Foata normal form. 3/2481 useless extension candidates. Maximal degree in co-relation 6755. Up to 2302 conditions per place. [2024-06-03 19:03:34,254 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 63 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2024-06-03 19:03:34,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 464 flow [2024-06-03 19:03:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:03:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:03:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-03 19:03:34,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-06-03 19:03:34,258 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 7 states and 166 transitions. [2024-06-03 19:03:34,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 464 flow [2024-06-03 19:03:34,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 430 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 19:03:34,263 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 236 flow [2024-06-03 19:03:34,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-06-03 19:03:34,265 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2024-06-03 19:03:34,265 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 236 flow [2024-06-03 19:03:34,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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) [2024-06-03 19:03:34,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:34,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:34,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 19:03:34,266 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:34,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2087886214, now seen corresponding path program 1 times [2024-06-03 19:03:34,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:34,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985030413] [2024-06-03 19:03:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:34,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:34,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:34,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985030413] [2024-06-03 19:03:34,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985030413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:34,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:34,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 19:03:34,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629495536] [2024-06-03 19:03:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:34,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 19:03:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:34,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 19:03:34,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 19:03:34,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:34,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2024-06-03 19:03:34,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:34,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:34,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:35,475 INFO L124 PetriNetUnfolderBase]: 1930/2978 cut-off events. [2024-06-03 19:03:35,476 INFO L125 PetriNetUnfolderBase]: For 4641/4641 co-relation queries the response was YES. [2024-06-03 19:03:35,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 2978 events. 1930/2978 cut-off events. For 4641/4641 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14843 event pairs, 825 based on Foata normal form. 2/2979 useless extension candidates. Maximal degree in co-relation 8805. Up to 2849 conditions per place. [2024-06-03 19:03:35,489 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 51 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-06-03 19:03:35,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 398 flow [2024-06-03 19:03:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 19:03:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 19:03:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-06-03 19:03:35,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 19:03:35,490 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 236 flow. Second operand 5 states and 99 transitions. [2024-06-03 19:03:35,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 398 flow [2024-06-03 19:03:35,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 360 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 19:03:35,493 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 244 flow [2024-06-03 19:03:35,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-06-03 19:03:35,494 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2024-06-03 19:03:35,494 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 244 flow [2024-06-03 19:03:35,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2024-06-03 19:03:35,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:35,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:35,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 19:03:35,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:35,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1024745175, now seen corresponding path program 1 times [2024-06-03 19:03:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442506528] [2024-06-03 19:03:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:35,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:36,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:36,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442506528] [2024-06-03 19:03:36,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442506528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:36,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:36,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:03:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307088378] [2024-06-03 19:03:36,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:03:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:03:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:03:37,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-03 19:03:37,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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) [2024-06-03 19:03:37,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:37,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-03 19:03:37,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:37,661 INFO L124 PetriNetUnfolderBase]: 1797/2829 cut-off events. [2024-06-03 19:03:37,662 INFO L125 PetriNetUnfolderBase]: For 6559/6559 co-relation queries the response was YES. [2024-06-03 19:03:37,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8943 conditions, 2829 events. 1797/2829 cut-off events. For 6559/6559 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14603 event pairs, 603 based on Foata normal form. 6/2824 useless extension candidates. Maximal degree in co-relation 8921. Up to 2550 conditions per place. [2024-06-03 19:03:37,679 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 63 selfloop transitions, 17 changer transitions 0/87 dead transitions. [2024-06-03 19:03:37,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 500 flow [2024-06-03 19:03:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:03:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:03:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-03 19:03:37,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-06-03 19:03:37,696 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 244 flow. Second operand 7 states and 163 transitions. [2024-06-03 19:03:37,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 500 flow [2024-06-03 19:03:37,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 478 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 19:03:37,700 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 279 flow [2024-06-03 19:03:37,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-06-03 19:03:37,701 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-06-03 19:03:37,701 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 279 flow [2024-06-03 19:03:37,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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) [2024-06-03 19:03:37,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:37,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:37,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 19:03:37,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:37,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash -310686871, now seen corresponding path program 1 times [2024-06-03 19:03:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108165121] [2024-06-03 19:03:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:38,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108165121] [2024-06-03 19:03:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108165121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:38,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:03:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055741613] [2024-06-03 19:03:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:38,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:03:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:38,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:03:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:03:38,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:38,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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) [2024-06-03 19:03:38,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:38,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:38,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:38,992 INFO L124 PetriNetUnfolderBase]: 1911/2947 cut-off events. [2024-06-03 19:03:38,993 INFO L125 PetriNetUnfolderBase]: For 8888/8888 co-relation queries the response was YES. [2024-06-03 19:03:38,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9828 conditions, 2947 events. 1911/2947 cut-off events. For 8888/8888 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14701 event pairs, 750 based on Foata normal form. 4/2950 useless extension candidates. Maximal degree in co-relation 9806. Up to 2802 conditions per place. [2024-06-03 19:03:39,013 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 57 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-06-03 19:03:39,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 477 flow [2024-06-03 19:03:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:03:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:03:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-03 19:03:39,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-03 19:03:39,015 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 279 flow. Second operand 6 states and 116 transitions. [2024-06-03 19:03:39,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 477 flow [2024-06-03 19:03:39,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 428 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 19:03:39,020 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 288 flow [2024-06-03 19:03:39,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-06-03 19:03:39,021 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-06-03 19:03:39,021 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 288 flow [2024-06-03 19:03:39,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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) [2024-06-03 19:03:39,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:39,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:39,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 19:03:39,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:39,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash 641949573, now seen corresponding path program 1 times [2024-06-03 19:03:39,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:39,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414024630] [2024-06-03 19:03:39,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:39,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:39,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:39,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414024630] [2024-06-03 19:03:39,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414024630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:39,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:39,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:03:39,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199394911] [2024-06-03 19:03:39,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:39,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:03:39,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:39,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:03:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:03:40,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:40,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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) [2024-06-03 19:03:40,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:40,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:40,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:40,468 INFO L124 PetriNetUnfolderBase]: 1922/2987 cut-off events. [2024-06-03 19:03:40,468 INFO L125 PetriNetUnfolderBase]: For 11077/11081 co-relation queries the response was YES. [2024-06-03 19:03:40,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 2987 events. 1922/2987 cut-off events. For 11077/11081 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15026 event pairs, 751 based on Foata normal form. 6/2992 useless extension candidates. Maximal degree in co-relation 10441. Up to 2801 conditions per place. [2024-06-03 19:03:40,484 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 62 selfloop transitions, 16 changer transitions 0/83 dead transitions. [2024-06-03 19:03:40,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 570 flow [2024-06-03 19:03:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:03:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:03:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-03 19:03:40,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-03 19:03:40,486 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 288 flow. Second operand 6 states and 122 transitions. [2024-06-03 19:03:40,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 570 flow [2024-06-03 19:03:40,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 536 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 19:03:40,493 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 348 flow [2024-06-03 19:03:40,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-06-03 19:03:40,495 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-06-03 19:03:40,495 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 348 flow [2024-06-03 19:03:40,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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) [2024-06-03 19:03:40,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:40,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:40,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 19:03:40,497 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:40,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:40,497 INFO L85 PathProgramCache]: Analyzing trace with hash -697280173, now seen corresponding path program 2 times [2024-06-03 19:03:40,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430083759] [2024-06-03 19:03:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:41,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430083759] [2024-06-03 19:03:41,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430083759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:41,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:41,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:03:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338231544] [2024-06-03 19:03:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:41,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:03:41,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:03:41,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:03:41,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:41,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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) [2024-06-03 19:03:41,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:41,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:41,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:41,897 INFO L124 PetriNetUnfolderBase]: 1917/2979 cut-off events. [2024-06-03 19:03:41,897 INFO L125 PetriNetUnfolderBase]: For 13729/13729 co-relation queries the response was YES. [2024-06-03 19:03:41,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11037 conditions, 2979 events. 1917/2979 cut-off events. For 13729/13729 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14983 event pairs, 747 based on Foata normal form. 2/2980 useless extension candidates. Maximal degree in co-relation 11012. Up to 2820 conditions per place. [2024-06-03 19:03:41,914 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 62 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-06-03 19:03:41,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 532 flow [2024-06-03 19:03:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:03:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:03:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-03 19:03:41,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-06-03 19:03:41,915 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 348 flow. Second operand 6 states and 115 transitions. [2024-06-03 19:03:41,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 532 flow [2024-06-03 19:03:41,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 492 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-03 19:03:41,925 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 338 flow [2024-06-03 19:03:41,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-03 19:03:41,926 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-06-03 19:03:41,926 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 338 flow [2024-06-03 19:03:41,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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) [2024-06-03 19:03:41,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:41,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:41,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 19:03:41,927 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:41,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:41,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1870727301, now seen corresponding path program 1 times [2024-06-03 19:03:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:41,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512611998] [2024-06-03 19:03:41,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:41,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:43,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512611998] [2024-06-03 19:03:43,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512611998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:43,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:43,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:03:43,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656263996] [2024-06-03 19:03:43,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:43,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:03:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:43,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:03:43,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:03:43,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:43,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:43,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:43,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:43,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:43,689 INFO L124 PetriNetUnfolderBase]: 1928/2995 cut-off events. [2024-06-03 19:03:43,689 INFO L125 PetriNetUnfolderBase]: For 16086/16090 co-relation queries the response was YES. [2024-06-03 19:03:43,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11386 conditions, 2995 events. 1928/2995 cut-off events. For 16086/16090 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15102 event pairs, 733 based on Foata normal form. 6/3000 useless extension candidates. Maximal degree in co-relation 11359. Up to 2772 conditions per place. [2024-06-03 19:03:43,706 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 67 selfloop transitions, 24 changer transitions 0/96 dead transitions. [2024-06-03 19:03:43,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 680 flow [2024-06-03 19:03:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:03:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:03:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-03 19:03:43,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 19:03:43,708 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 338 flow. Second operand 7 states and 143 transitions. [2024-06-03 19:03:43,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 680 flow [2024-06-03 19:03:43,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 650 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-03 19:03:43,714 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 426 flow [2024-06-03 19:03:43,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-06-03 19:03:43,715 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-06-03 19:03:43,715 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 426 flow [2024-06-03 19:03:43,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:43,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:43,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:43,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 19:03:43,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:43,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:43,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1870733098, now seen corresponding path program 1 times [2024-06-03 19:03:43,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:43,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199062149] [2024-06-03 19:03:43,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:43,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:44,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199062149] [2024-06-03 19:03:44,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199062149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:44,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:44,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:03:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16770950] [2024-06-03 19:03:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:44,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:03:44,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:03:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:03:44,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:44,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 426 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:44,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:44,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:44,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:45,270 INFO L124 PetriNetUnfolderBase]: 1966/3052 cut-off events. [2024-06-03 19:03:45,271 INFO L125 PetriNetUnfolderBase]: For 20071/20075 co-relation queries the response was YES. [2024-06-03 19:03:45,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12305 conditions, 3052 events. 1966/3052 cut-off events. For 20071/20075 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15356 event pairs, 688 based on Foata normal form. 5/3055 useless extension candidates. Maximal degree in co-relation 12277. Up to 2811 conditions per place. [2024-06-03 19:03:45,286 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 76 selfloop transitions, 23 changer transitions 0/104 dead transitions. [2024-06-03 19:03:45,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 798 flow [2024-06-03 19:03:45,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:03:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:03:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-03 19:03:45,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-03 19:03:45,288 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 426 flow. Second operand 7 states and 143 transitions. [2024-06-03 19:03:45,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 798 flow [2024-06-03 19:03:45,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 752 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 19:03:45,300 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 524 flow [2024-06-03 19:03:45,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2024-06-03 19:03:45,301 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-06-03 19:03:45,301 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 524 flow [2024-06-03 19:03:45,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:45,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:45,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:45,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 19:03:45,302 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:45,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1870732881, now seen corresponding path program 2 times [2024-06-03 19:03:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:45,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242714064] [2024-06-03 19:03:45,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:46,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242714064] [2024-06-03 19:03:46,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242714064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:46,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:46,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:03:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341655274] [2024-06-03 19:03:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:46,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:03:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:46,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:03:46,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:03:46,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:46,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 524 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:46,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:46,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:46,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:46,939 INFO L124 PetriNetUnfolderBase]: 1977/3069 cut-off events. [2024-06-03 19:03:46,939 INFO L125 PetriNetUnfolderBase]: For 23880/23882 co-relation queries the response was YES. [2024-06-03 19:03:46,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13142 conditions, 3069 events. 1977/3069 cut-off events. For 23880/23882 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15435 event pairs, 699 based on Foata normal form. 4/3072 useless extension candidates. Maximal degree in co-relation 13111. Up to 2874 conditions per place. [2024-06-03 19:03:46,953 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 79 selfloop transitions, 19 changer transitions 0/103 dead transitions. [2024-06-03 19:03:46,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 806 flow [2024-06-03 19:03:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:03:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:03:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-03 19:03:46,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2024-06-03 19:03:46,954 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 524 flow. Second operand 7 states and 137 transitions. [2024-06-03 19:03:46,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 806 flow [2024-06-03 19:03:46,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 776 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-03 19:03:46,965 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 576 flow [2024-06-03 19:03:46,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2024-06-03 19:03:46,966 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2024-06-03 19:03:46,966 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 576 flow [2024-06-03 19:03:46,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:46,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:46,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:46,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 19:03:46,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:46,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash -140848017, now seen corresponding path program 3 times [2024-06-03 19:03:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:46,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514327244] [2024-06-03 19:03:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514327244] [2024-06-03 19:03:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514327244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:48,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:48,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:03:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694719641] [2024-06-03 19:03:48,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:48,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:03:48,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:48,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:03:48,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:03:48,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:48,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 576 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:48,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:48,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:48,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:48,772 INFO L124 PetriNetUnfolderBase]: 1972/3056 cut-off events. [2024-06-03 19:03:48,773 INFO L125 PetriNetUnfolderBase]: For 26846/26846 co-relation queries the response was YES. [2024-06-03 19:03:48,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13390 conditions, 3056 events. 1972/3056 cut-off events. For 26846/26846 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15302 event pairs, 695 based on Foata normal form. 2/3057 useless extension candidates. Maximal degree in co-relation 13356. Up to 2891 conditions per place. [2024-06-03 19:03:48,788 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 81 selfloop transitions, 14 changer transitions 0/100 dead transitions. [2024-06-03 19:03:48,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 814 flow [2024-06-03 19:03:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:03:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:03:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-03 19:03:48,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 19:03:48,789 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 576 flow. Second operand 7 states and 132 transitions. [2024-06-03 19:03:48,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 814 flow [2024-06-03 19:03:48,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 100 transitions, 748 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-03 19:03:48,804 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 546 flow [2024-06-03 19:03:48,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-06-03 19:03:48,805 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2024-06-03 19:03:48,805 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 546 flow [2024-06-03 19:03:48,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:48,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:48,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:48,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 19:03:48,805 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:48,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash -500754080, now seen corresponding path program 2 times [2024-06-03 19:03:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:48,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973022304] [2024-06-03 19:03:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973022304] [2024-06-03 19:03:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973022304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:49,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:03:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326968848] [2024-06-03 19:03:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:49,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:03:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:03:49,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:03:49,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:49,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:49,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:49,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:49,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:50,244 INFO L124 PetriNetUnfolderBase]: 1994/3093 cut-off events. [2024-06-03 19:03:50,244 INFO L125 PetriNetUnfolderBase]: For 30475/30475 co-relation queries the response was YES. [2024-06-03 19:03:50,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13775 conditions, 3093 events. 1994/3093 cut-off events. For 30475/30475 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15517 event pairs, 695 based on Foata normal form. 4/3096 useless extension candidates. Maximal degree in co-relation 13740. Up to 2914 conditions per place. [2024-06-03 19:03:50,260 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 85 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-06-03 19:03:50,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 104 transitions, 832 flow [2024-06-03 19:03:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:03:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:03:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 19:03:50,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-03 19:03:50,262 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 546 flow. Second operand 7 states and 133 transitions. [2024-06-03 19:03:50,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 104 transitions, 832 flow [2024-06-03 19:03:50,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 782 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 19:03:50,278 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 574 flow [2024-06-03 19:03:50,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2024-06-03 19:03:50,278 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2024-06-03 19:03:50,279 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 574 flow [2024-06-03 19:03:50,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:50,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:50,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:50,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 19:03:50,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:50,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1236366884, now seen corresponding path program 3 times [2024-06-03 19:03:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:50,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602054150] [2024-06-03 19:03:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:51,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602054150] [2024-06-03 19:03:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602054150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:51,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:03:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362125076] [2024-06-03 19:03:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:51,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:03:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:03:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:03:51,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:51,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 574 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:51,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:51,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:51,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:51,756 INFO L124 PetriNetUnfolderBase]: 1984/3079 cut-off events. [2024-06-03 19:03:51,756 INFO L125 PetriNetUnfolderBase]: For 33837/33837 co-relation queries the response was YES. [2024-06-03 19:03:51,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 3079 events. 1984/3079 cut-off events. For 33837/33837 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15451 event pairs, 693 based on Foata normal form. 4/3082 useless extension candidates. Maximal degree in co-relation 13888. Up to 2873 conditions per place. [2024-06-03 19:03:51,778 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 81 selfloop transitions, 19 changer transitions 0/105 dead transitions. [2024-06-03 19:03:51,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 105 transitions, 830 flow [2024-06-03 19:03:51,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:03:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:03:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-03 19:03:51,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-03 19:03:51,781 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 574 flow. Second operand 7 states and 136 transitions. [2024-06-03 19:03:51,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 105 transitions, 830 flow [2024-06-03 19:03:51,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 764 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-03 19:03:51,806 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 554 flow [2024-06-03 19:03:51,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2024-06-03 19:03:51,807 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2024-06-03 19:03:51,807 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 554 flow [2024-06-03 19:03:51,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2024-06-03 19:03:51,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:51,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:51,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 19:03:51,808 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:51,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1547208780, now seen corresponding path program 1 times [2024-06-03 19:03:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624662079] [2024-06-03 19:03:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:52,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:52,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624662079] [2024-06-03 19:03:52,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624662079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:52,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 19:03:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829368073] [2024-06-03 19:03:52,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:52,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 19:03:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 19:03:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 19:03:52,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:52,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 554 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2024-06-03 19:03:52,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:52,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:52,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:53,202 INFO L124 PetriNetUnfolderBase]: 2402/3673 cut-off events. [2024-06-03 19:03:53,202 INFO L125 PetriNetUnfolderBase]: For 47931/47931 co-relation queries the response was YES. [2024-06-03 19:03:53,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17121 conditions, 3673 events. 2402/3673 cut-off events. For 47931/47931 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18189 event pairs, 959 based on Foata normal form. 1/3673 useless extension candidates. Maximal degree in co-relation 17086. Up to 3525 conditions per place. [2024-06-03 19:03:53,219 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 72 selfloop transitions, 8 changer transitions 0/95 dead transitions. [2024-06-03 19:03:53,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 756 flow [2024-06-03 19:03:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 19:03:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 19:03:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-03 19:03:53,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-06-03 19:03:53,222 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 554 flow. Second operand 5 states and 94 transitions. [2024-06-03 19:03:53,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 95 transitions, 756 flow [2024-06-03 19:03:53,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 95 transitions, 692 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 19:03:53,244 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 540 flow [2024-06-03 19:03:53,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=540, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2024-06-03 19:03:53,244 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2024-06-03 19:03:53,244 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 540 flow [2024-06-03 19:03:53,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2024-06-03 19:03:53,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:53,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:53,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 19:03:53,245 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:53,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1566484828, now seen corresponding path program 1 times [2024-06-03 19:03:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273697183] [2024-06-03 19:03:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273697183] [2024-06-03 19:03:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273697183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:54,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:03:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126246325] [2024-06-03 19:03:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:54,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:03:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:03:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:03:54,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:54,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 540 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:03:54,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:54,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:54,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:55,445 INFO L124 PetriNetUnfolderBase]: 2091/3226 cut-off events. [2024-06-03 19:03:55,446 INFO L125 PetriNetUnfolderBase]: For 46502/46502 co-relation queries the response was YES. [2024-06-03 19:03:55,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15783 conditions, 3226 events. 2091/3226 cut-off events. For 46502/46502 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16204 event pairs, 718 based on Foata normal form. 2/3227 useless extension candidates. Maximal degree in co-relation 15747. Up to 2994 conditions per place. [2024-06-03 19:03:55,462 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 99 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2024-06-03 19:03:55,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 122 transitions, 888 flow [2024-06-03 19:03:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:03:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:03:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-03 19:03:55,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-06-03 19:03:55,464 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 540 flow. Second operand 8 states and 158 transitions. [2024-06-03 19:03:55,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 122 transitions, 888 flow [2024-06-03 19:03:55,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 122 transitions, 860 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 19:03:55,485 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 594 flow [2024-06-03 19:03:55,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2024-06-03 19:03:55,485 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2024-06-03 19:03:55,485 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 594 flow [2024-06-03 19:03:55,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:03:55,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:55,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:55,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 19:03:55,486 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:55,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1566364858, now seen corresponding path program 2 times [2024-06-03 19:03:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:55,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132392218] [2024-06-03 19:03:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:56,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:56,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132392218] [2024-06-03 19:03:56,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132392218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:56,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:56,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:03:56,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330452794] [2024-06-03 19:03:56,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:56,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:03:56,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:03:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:03:56,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:56,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 594 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:03:56,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:56,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:56,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:57,388 INFO L124 PetriNetUnfolderBase]: 2102/3243 cut-off events. [2024-06-03 19:03:57,389 INFO L125 PetriNetUnfolderBase]: For 52346/52348 co-relation queries the response was YES. [2024-06-03 19:03:57,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16580 conditions, 3243 events. 2102/3243 cut-off events. For 52346/52348 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16312 event pairs, 722 based on Foata normal form. 4/3246 useless extension candidates. Maximal degree in co-relation 16543. Up to 2931 conditions per place. [2024-06-03 19:03:57,403 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 85 selfloop transitions, 36 changer transitions 0/127 dead transitions. [2024-06-03 19:03:57,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 127 transitions, 1060 flow [2024-06-03 19:03:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:03:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:03:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-03 19:03:57,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2024-06-03 19:03:57,405 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 594 flow. Second operand 8 states and 162 transitions. [2024-06-03 19:03:57,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 127 transitions, 1060 flow [2024-06-03 19:03:57,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 127 transitions, 1002 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 19:03:57,428 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 702 flow [2024-06-03 19:03:57,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2024-06-03 19:03:57,429 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-06-03 19:03:57,429 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 702 flow [2024-06-03 19:03:57,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:03:57,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:57,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:57,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 19:03:57,430 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:57,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1566364672, now seen corresponding path program 1 times [2024-06-03 19:03:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119871056] [2024-06-03 19:03:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:03:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:03:58,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:03:58,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119871056] [2024-06-03 19:03:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119871056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:03:58,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:03:58,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:03:58,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869717629] [2024-06-03 19:03:58,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:03:58,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:03:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:03:58,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:03:58,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:03:58,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:03:58,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 702 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:03:58,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:03:58,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:03:58,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:03:59,279 INFO L124 PetriNetUnfolderBase]: 2252/3481 cut-off events. [2024-06-03 19:03:59,279 INFO L125 PetriNetUnfolderBase]: For 63074/63087 co-relation queries the response was YES. [2024-06-03 19:03:59,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18486 conditions, 3481 events. 2252/3481 cut-off events. For 63074/63087 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17716 event pairs, 1068 based on Foata normal form. 4/3466 useless extension candidates. Maximal degree in co-relation 18448. Up to 3070 conditions per place. [2024-06-03 19:03:59,299 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 103 selfloop transitions, 42 changer transitions 0/151 dead transitions. [2024-06-03 19:03:59,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 151 transitions, 1355 flow [2024-06-03 19:03:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:03:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:03:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-03 19:03:59,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43686868686868685 [2024-06-03 19:03:59,302 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 702 flow. Second operand 9 states and 173 transitions. [2024-06-03 19:03:59,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 151 transitions, 1355 flow [2024-06-03 19:03:59,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 1278 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-03 19:03:59,343 INFO L231 Difference]: Finished difference. Result has 98 places, 119 transitions, 987 flow [2024-06-03 19:03:59,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=987, PETRI_PLACES=98, PETRI_TRANSITIONS=119} [2024-06-03 19:03:59,344 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2024-06-03 19:03:59,344 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 119 transitions, 987 flow [2024-06-03 19:03:59,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:03:59,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:03:59,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:03:59,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 19:03:59,346 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:03:59,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:03:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 966964028, now seen corresponding path program 2 times [2024-06-03 19:03:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:03:59,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726223418] [2024-06-03 19:03:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:03:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:03:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726223418] [2024-06-03 19:04:00,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726223418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:00,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:00,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:00,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15216989] [2024-06-03 19:04:00,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:00,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:00,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:00,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:00,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:00,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:00,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 119 transitions, 987 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:00,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:00,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:00,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:01,497 INFO L124 PetriNetUnfolderBase]: 2399/3701 cut-off events. [2024-06-03 19:04:01,497 INFO L125 PetriNetUnfolderBase]: For 71121/71130 co-relation queries the response was YES. [2024-06-03 19:04:01,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20655 conditions, 3701 events. 2399/3701 cut-off events. For 71121/71130 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18870 event pairs, 706 based on Foata normal form. 10/3709 useless extension candidates. Maximal degree in co-relation 20611. Up to 3158 conditions per place. [2024-06-03 19:04:01,522 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 119 selfloop transitions, 89 changer transitions 0/214 dead transitions. [2024-06-03 19:04:01,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 214 transitions, 2245 flow [2024-06-03 19:04:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:04:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:04:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-03 19:04:01,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-03 19:04:01,525 INFO L175 Difference]: Start difference. First operand has 98 places, 119 transitions, 987 flow. Second operand 9 states and 186 transitions. [2024-06-03 19:04:01,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 214 transitions, 2245 flow [2024-06-03 19:04:01,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 214 transitions, 2111 flow, removed 66 selfloop flow, removed 1 redundant places. [2024-06-03 19:04:01,577 INFO L231 Difference]: Finished difference. Result has 110 places, 174 transitions, 1783 flow [2024-06-03 19:04:01,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1783, PETRI_PLACES=110, PETRI_TRANSITIONS=174} [2024-06-03 19:04:01,584 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 65 predicate places. [2024-06-03 19:04:01,584 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 174 transitions, 1783 flow [2024-06-03 19:04:01,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:01,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:01,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:01,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 19:04:01,585 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:01,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:01,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2076665008, now seen corresponding path program 3 times [2024-06-03 19:04:01,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:01,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021355869] [2024-06-03 19:04:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:02,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021355869] [2024-06-03 19:04:02,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021355869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:02,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:02,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:02,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756343576] [2024-06-03 19:04:02,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:02,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:02,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:02,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:02,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 174 transitions, 1783 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:02,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:02,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:02,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:03,535 INFO L124 PetriNetUnfolderBase]: 2625/4047 cut-off events. [2024-06-03 19:04:03,535 INFO L125 PetriNetUnfolderBase]: For 86512/86532 co-relation queries the response was YES. [2024-06-03 19:04:03,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24603 conditions, 4047 events. 2625/4047 cut-off events. For 86512/86532 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21134 event pairs, 1015 based on Foata normal form. 8/4031 useless extension candidates. Maximal degree in co-relation 24552. Up to 3482 conditions per place. [2024-06-03 19:04:03,568 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 163 selfloop transitions, 113 changer transitions 0/282 dead transitions. [2024-06-03 19:04:03,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 282 transitions, 3431 flow [2024-06-03 19:04:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:04:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:04:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-03 19:04:03,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-06-03 19:04:03,570 INFO L175 Difference]: Start difference. First operand has 110 places, 174 transitions, 1783 flow. Second operand 9 states and 184 transitions. [2024-06-03 19:04:03,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 282 transitions, 3431 flow [2024-06-03 19:04:03,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 282 transitions, 3328 flow, removed 46 selfloop flow, removed 2 redundant places. [2024-06-03 19:04:03,672 INFO L231 Difference]: Finished difference. Result has 121 places, 240 transitions, 2976 flow [2024-06-03 19:04:03,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2976, PETRI_PLACES=121, PETRI_TRANSITIONS=240} [2024-06-03 19:04:03,673 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 76 predicate places. [2024-06-03 19:04:03,673 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 240 transitions, 2976 flow [2024-06-03 19:04:03,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:03,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:03,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:03,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 19:04:03,674 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:03,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2007057236, now seen corresponding path program 3 times [2024-06-03 19:04:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337358944] [2024-06-03 19:04:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:04,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:04,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337358944] [2024-06-03 19:04:04,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337358944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:04,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306144144] [2024-06-03 19:04:04,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:04,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:04,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:04,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:04,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:04,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:04,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 240 transitions, 2976 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:04,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:04,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:04,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:05,554 INFO L124 PetriNetUnfolderBase]: 2661/4101 cut-off events. [2024-06-03 19:04:05,554 INFO L125 PetriNetUnfolderBase]: For 95975/95995 co-relation queries the response was YES. [2024-06-03 19:04:05,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26413 conditions, 4101 events. 2661/4101 cut-off events. For 95975/95995 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21341 event pairs, 1002 based on Foata normal form. 8/4086 useless extension candidates. Maximal degree in co-relation 26356. Up to 3762 conditions per place. [2024-06-03 19:04:05,580 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 231 selfloop transitions, 47 changer transitions 0/284 dead transitions. [2024-06-03 19:04:05,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 284 transitions, 3830 flow [2024-06-03 19:04:05,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:04:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:04:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-03 19:04:05,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-03 19:04:05,582 INFO L175 Difference]: Start difference. First operand has 121 places, 240 transitions, 2976 flow. Second operand 9 states and 174 transitions. [2024-06-03 19:04:05,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 284 transitions, 3830 flow [2024-06-03 19:04:05,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 284 transitions, 3701 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-03 19:04:05,729 INFO L231 Difference]: Finished difference. Result has 130 places, 255 transitions, 3205 flow [2024-06-03 19:04:05,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2849, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3205, PETRI_PLACES=130, PETRI_TRANSITIONS=255} [2024-06-03 19:04:05,730 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2024-06-03 19:04:05,730 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 255 transitions, 3205 flow [2024-06-03 19:04:05,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:05,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:05,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:05,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 19:04:05,730 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:05,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:05,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1744370428, now seen corresponding path program 4 times [2024-06-03 19:04:05,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:05,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614740055] [2024-06-03 19:04:05,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614740055] [2024-06-03 19:04:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614740055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:06,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866198101] [2024-06-03 19:04:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:06,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:06,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:06,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 255 transitions, 3205 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:06,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:06,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:06,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:07,915 INFO L124 PetriNetUnfolderBase]: 2745/4235 cut-off events. [2024-06-03 19:04:07,915 INFO L125 PetriNetUnfolderBase]: For 106891/106914 co-relation queries the response was YES. [2024-06-03 19:04:07,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28251 conditions, 4235 events. 2745/4235 cut-off events. For 106891/106914 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 22309 event pairs, 1017 based on Foata normal form. 10/4221 useless extension candidates. Maximal degree in co-relation 28189. Up to 3722 conditions per place. [2024-06-03 19:04:07,954 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 211 selfloop transitions, 98 changer transitions 0/315 dead transitions. [2024-06-03 19:04:07,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 315 transitions, 4465 flow [2024-06-03 19:04:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:04:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:04:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-03 19:04:07,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-06-03 19:04:07,955 INFO L175 Difference]: Start difference. First operand has 130 places, 255 transitions, 3205 flow. Second operand 9 states and 184 transitions. [2024-06-03 19:04:07,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 315 transitions, 4465 flow [2024-06-03 19:04:08,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 315 transitions, 4371 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-03 19:04:08,079 INFO L231 Difference]: Finished difference. Result has 136 places, 278 transitions, 3748 flow [2024-06-03 19:04:08,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3111, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3748, PETRI_PLACES=136, PETRI_TRANSITIONS=278} [2024-06-03 19:04:08,079 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 91 predicate places. [2024-06-03 19:04:08,079 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 278 transitions, 3748 flow [2024-06-03 19:04:08,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:08,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:08,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:08,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 19:04:08,080 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:08,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1662977882, now seen corresponding path program 5 times [2024-06-03 19:04:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427195841] [2024-06-03 19:04:08,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:09,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427195841] [2024-06-03 19:04:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427195841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:09,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:09,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074126331] [2024-06-03 19:04:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:09,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:09,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:09,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:09,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:09,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 278 transitions, 3748 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:09,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:09,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:09,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:10,169 INFO L124 PetriNetUnfolderBase]: 2723/4204 cut-off events. [2024-06-03 19:04:10,169 INFO L125 PetriNetUnfolderBase]: For 113103/113126 co-relation queries the response was YES. [2024-06-03 19:04:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28378 conditions, 4204 events. 2723/4204 cut-off events. For 113103/113126 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 22083 event pairs, 1019 based on Foata normal form. 10/4190 useless extension candidates. Maximal degree in co-relation 28315. Up to 3758 conditions per place. [2024-06-03 19:04:10,205 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 225 selfloop transitions, 79 changer transitions 0/310 dead transitions. [2024-06-03 19:04:10,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 310 transitions, 4476 flow [2024-06-03 19:04:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:04:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:04:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-03 19:04:10,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45202020202020204 [2024-06-03 19:04:10,206 INFO L175 Difference]: Start difference. First operand has 136 places, 278 transitions, 3748 flow. Second operand 9 states and 179 transitions. [2024-06-03 19:04:10,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 310 transitions, 4476 flow [2024-06-03 19:04:10,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 310 transitions, 4202 flow, removed 101 selfloop flow, removed 4 redundant places. [2024-06-03 19:04:10,342 INFO L231 Difference]: Finished difference. Result has 141 places, 278 transitions, 3653 flow [2024-06-03 19:04:10,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3474, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3653, PETRI_PLACES=141, PETRI_TRANSITIONS=278} [2024-06-03 19:04:10,343 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-06-03 19:04:10,343 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 278 transitions, 3653 flow [2024-06-03 19:04:10,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:10,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:10,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:10,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 19:04:10,343 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:10,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2136821936, now seen corresponding path program 4 times [2024-06-03 19:04:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:10,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846555716] [2024-06-03 19:04:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:10,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:11,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:11,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846555716] [2024-06-03 19:04:11,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846555716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:11,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:11,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:11,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434189521] [2024-06-03 19:04:11,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:11,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:11,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:11,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:11,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:11,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:11,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 278 transitions, 3653 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:11,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:11,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:11,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:12,177 INFO L124 PetriNetUnfolderBase]: 2745/4225 cut-off events. [2024-06-03 19:04:12,177 INFO L125 PetriNetUnfolderBase]: For 118695/118720 co-relation queries the response was YES. [2024-06-03 19:04:12,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28924 conditions, 4225 events. 2745/4225 cut-off events. For 118695/118720 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22133 event pairs, 1006 based on Foata normal form. 8/4210 useless extension candidates. Maximal degree in co-relation 28859. Up to 3844 conditions per place. [2024-06-03 19:04:12,209 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 245 selfloop transitions, 58 changer transitions 0/309 dead transitions. [2024-06-03 19:04:12,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 309 transitions, 4451 flow [2024-06-03 19:04:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:04:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:04:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-03 19:04:12,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403409090909091 [2024-06-03 19:04:12,211 INFO L175 Difference]: Start difference. First operand has 141 places, 278 transitions, 3653 flow. Second operand 8 states and 155 transitions. [2024-06-03 19:04:12,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 309 transitions, 4451 flow [2024-06-03 19:04:12,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 309 transitions, 4248 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 19:04:12,330 INFO L231 Difference]: Finished difference. Result has 141 places, 283 transitions, 3688 flow [2024-06-03 19:04:12,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3452, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3688, PETRI_PLACES=141, PETRI_TRANSITIONS=283} [2024-06-03 19:04:12,331 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-06-03 19:04:12,331 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 283 transitions, 3688 flow [2024-06-03 19:04:12,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:12,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:12,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:12,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 19:04:12,332 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:12,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2136815240, now seen corresponding path program 6 times [2024-06-03 19:04:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:12,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405388398] [2024-06-03 19:04:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405388398] [2024-06-03 19:04:13,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405388398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024607781] [2024-06-03 19:04:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:13,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:13,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:13,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:13,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 283 transitions, 3688 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:13,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:13,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:13,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:14,127 INFO L124 PetriNetUnfolderBase]: 2795/4308 cut-off events. [2024-06-03 19:04:14,128 INFO L125 PetriNetUnfolderBase]: For 130131/130159 co-relation queries the response was YES. [2024-06-03 19:04:14,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30103 conditions, 4308 events. 2795/4308 cut-off events. For 130131/130159 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 22686 event pairs, 1023 based on Foata normal form. 10/4294 useless extension candidates. Maximal degree in co-relation 30037. Up to 3792 conditions per place. [2024-06-03 19:04:14,164 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 221 selfloop transitions, 100 changer transitions 0/327 dead transitions. [2024-06-03 19:04:14,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 327 transitions, 4714 flow [2024-06-03 19:04:14,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:04:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:04:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-03 19:04:14,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45170454545454547 [2024-06-03 19:04:14,167 INFO L175 Difference]: Start difference. First operand has 141 places, 283 transitions, 3688 flow. Second operand 8 states and 159 transitions. [2024-06-03 19:04:14,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 327 transitions, 4714 flow [2024-06-03 19:04:14,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 327 transitions, 4550 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-03 19:04:14,292 INFO L231 Difference]: Finished difference. Result has 143 places, 296 transitions, 4037 flow [2024-06-03 19:04:14,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3524, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4037, PETRI_PLACES=143, PETRI_TRANSITIONS=296} [2024-06-03 19:04:14,293 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places. [2024-06-03 19:04:14,293 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 296 transitions, 4037 flow [2024-06-03 19:04:14,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:14,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:14,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:14,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 19:04:14,293 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:14,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2136821750, now seen corresponding path program 7 times [2024-06-03 19:04:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:14,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485020751] [2024-06-03 19:04:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:15,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:15,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485020751] [2024-06-03 19:04:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485020751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116601964] [2024-06-03 19:04:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:15,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:15,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:15,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:15,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:15,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 296 transitions, 4037 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:15,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:15,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:15,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:16,343 INFO L124 PetriNetUnfolderBase]: 2845/4385 cut-off events. [2024-06-03 19:04:16,344 INFO L125 PetriNetUnfolderBase]: For 130899/130924 co-relation queries the response was YES. [2024-06-03 19:04:16,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30588 conditions, 4385 events. 2845/4385 cut-off events. For 130899/130924 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 23238 event pairs, 1011 based on Foata normal form. 10/4371 useless extension candidates. Maximal degree in co-relation 30521. Up to 3756 conditions per place. [2024-06-03 19:04:16,383 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 200 selfloop transitions, 137 changer transitions 0/343 dead transitions. [2024-06-03 19:04:16,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 343 transitions, 5140 flow [2024-06-03 19:04:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:04:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:04:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-03 19:04:16,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2024-06-03 19:04:16,385 INFO L175 Difference]: Start difference. First operand has 143 places, 296 transitions, 4037 flow. Second operand 8 states and 162 transitions. [2024-06-03 19:04:16,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 343 transitions, 5140 flow [2024-06-03 19:04:16,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 343 transitions, 4837 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-03 19:04:16,529 INFO L231 Difference]: Finished difference. Result has 144 places, 309 transitions, 4341 flow [2024-06-03 19:04:16,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3734, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4341, PETRI_PLACES=144, PETRI_TRANSITIONS=309} [2024-06-03 19:04:16,530 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 99 predicate places. [2024-06-03 19:04:16,530 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 309 transitions, 4341 flow [2024-06-03 19:04:16,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:16,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:16,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:16,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 19:04:16,530 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:16,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash 687506316, now seen corresponding path program 8 times [2024-06-03 19:04:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542149422] [2024-06-03 19:04:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:17,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:17,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542149422] [2024-06-03 19:04:17,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542149422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:17,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:17,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:17,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394487576] [2024-06-03 19:04:17,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:17,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:17,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:17,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:17,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:17,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:17,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 309 transitions, 4341 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:17,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:17,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:17,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:18,415 INFO L124 PetriNetUnfolderBase]: 2910/4486 cut-off events. [2024-06-03 19:04:18,415 INFO L125 PetriNetUnfolderBase]: For 134980/135002 co-relation queries the response was YES. [2024-06-03 19:04:18,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31568 conditions, 4486 events. 2910/4486 cut-off events. For 134980/135002 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 23825 event pairs, 1148 based on Foata normal form. 8/4468 useless extension candidates. Maximal degree in co-relation 31501. Up to 4102 conditions per place. [2024-06-03 19:04:18,448 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 298 selfloop transitions, 50 changer transitions 0/354 dead transitions. [2024-06-03 19:04:18,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 354 transitions, 5491 flow [2024-06-03 19:04:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:04:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:04:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-03 19:04:18,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 19:04:18,450 INFO L175 Difference]: Start difference. First operand has 144 places, 309 transitions, 4341 flow. Second operand 8 states and 154 transitions. [2024-06-03 19:04:18,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 354 transitions, 5491 flow [2024-06-03 19:04:18,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 354 transitions, 5085 flow, removed 73 selfloop flow, removed 7 redundant places. [2024-06-03 19:04:18,596 INFO L231 Difference]: Finished difference. Result has 145 places, 322 transitions, 4383 flow [2024-06-03 19:04:18,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3935, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4383, PETRI_PLACES=145, PETRI_TRANSITIONS=322} [2024-06-03 19:04:18,597 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 100 predicate places. [2024-06-03 19:04:18,597 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 322 transitions, 4383 flow [2024-06-03 19:04:18,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:18,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:18,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:18,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 19:04:18,598 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:18,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1389233338, now seen corresponding path program 5 times [2024-06-03 19:04:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:18,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070711655] [2024-06-03 19:04:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070711655] [2024-06-03 19:04:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070711655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963600096] [2024-06-03 19:04:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:19,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:19,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:19,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:19,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 322 transitions, 4383 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:19,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:19,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:19,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:20,477 INFO L124 PetriNetUnfolderBase]: 2916/4493 cut-off events. [2024-06-03 19:04:20,477 INFO L125 PetriNetUnfolderBase]: For 131651/131673 co-relation queries the response was YES. [2024-06-03 19:04:20,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31169 conditions, 4493 events. 2916/4493 cut-off events. For 131651/131673 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23881 event pairs, 1147 based on Foata normal form. 4/4471 useless extension candidates. Maximal degree in co-relation 31102. Up to 4176 conditions per place. [2024-06-03 19:04:20,513 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 315 selfloop transitions, 27 changer transitions 0/348 dead transitions. [2024-06-03 19:04:20,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 348 transitions, 5209 flow [2024-06-03 19:04:20,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:04:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:04:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-03 19:04:20,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2024-06-03 19:04:20,515 INFO L175 Difference]: Start difference. First operand has 145 places, 322 transitions, 4383 flow. Second operand 8 states and 150 transitions. [2024-06-03 19:04:20,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 348 transitions, 5209 flow [2024-06-03 19:04:20,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 348 transitions, 4918 flow, removed 104 selfloop flow, removed 6 redundant places. [2024-06-03 19:04:20,658 INFO L231 Difference]: Finished difference. Result has 147 places, 325 transitions, 4220 flow [2024-06-03 19:04:20,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4094, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4220, PETRI_PLACES=147, PETRI_TRANSITIONS=325} [2024-06-03 19:04:20,659 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 102 predicate places. [2024-06-03 19:04:20,659 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 325 transitions, 4220 flow [2024-06-03 19:04:20,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:20,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:20,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:20,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 19:04:20,659 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:20,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1964331860, now seen corresponding path program 9 times [2024-06-03 19:04:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496223096] [2024-06-03 19:04:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:21,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496223096] [2024-06-03 19:04:21,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496223096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:21,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:21,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:21,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828043520] [2024-06-03 19:04:21,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:21,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:21,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:21,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:21,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 325 transitions, 4220 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:21,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:21,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:21,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:22,797 INFO L124 PetriNetUnfolderBase]: 2966/4568 cut-off events. [2024-06-03 19:04:22,798 INFO L125 PetriNetUnfolderBase]: For 142822/142847 co-relation queries the response was YES. [2024-06-03 19:04:22,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32193 conditions, 4568 events. 2966/4568 cut-off events. For 142822/142847 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 24338 event pairs, 1141 based on Foata normal form. 8/4550 useless extension candidates. Maximal degree in co-relation 32125. Up to 4074 conditions per place. [2024-06-03 19:04:22,839 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 285 selfloop transitions, 81 changer transitions 0/372 dead transitions. [2024-06-03 19:04:22,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 372 transitions, 5533 flow [2024-06-03 19:04:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:04:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:04:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-03 19:04:22,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4460227272727273 [2024-06-03 19:04:22,841 INFO L175 Difference]: Start difference. First operand has 147 places, 325 transitions, 4220 flow. Second operand 8 states and 157 transitions. [2024-06-03 19:04:22,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 372 transitions, 5533 flow [2024-06-03 19:04:23,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 372 transitions, 5429 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-03 19:04:23,013 INFO L231 Difference]: Finished difference. Result has 149 places, 338 transitions, 4623 flow [2024-06-03 19:04:23,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4116, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4623, PETRI_PLACES=149, PETRI_TRANSITIONS=338} [2024-06-03 19:04:23,013 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 104 predicate places. [2024-06-03 19:04:23,013 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 338 transitions, 4623 flow [2024-06-03 19:04:23,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:23,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:23,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:23,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 19:04:23,014 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:23,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash -17251686, now seen corresponding path program 10 times [2024-06-03 19:04:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:23,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269744488] [2024-06-03 19:04:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:23,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269744488] [2024-06-03 19:04:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269744488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:23,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:23,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810214774] [2024-06-03 19:04:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:23,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:23,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:23,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:24,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:24,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 338 transitions, 4623 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:24,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:24,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:24,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:25,060 INFO L124 PetriNetUnfolderBase]: 2944/4540 cut-off events. [2024-06-03 19:04:25,061 INFO L125 PetriNetUnfolderBase]: For 149196/149221 co-relation queries the response was YES. [2024-06-03 19:04:25,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32173 conditions, 4540 events. 2944/4540 cut-off events. For 149196/149221 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 24207 event pairs, 1154 based on Foata normal form. 8/4522 useless extension candidates. Maximal degree in co-relation 32104. Up to 4192 conditions per place. [2024-06-03 19:04:25,093 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 325 selfloop transitions, 35 changer transitions 0/366 dead transitions. [2024-06-03 19:04:25,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 366 transitions, 5462 flow [2024-06-03 19:04:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:04:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:04:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-03 19:04:25,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4289772727272727 [2024-06-03 19:04:25,095 INFO L175 Difference]: Start difference. First operand has 149 places, 338 transitions, 4623 flow. Second operand 8 states and 151 transitions. [2024-06-03 19:04:25,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 366 transitions, 5462 flow [2024-06-03 19:04:25,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 366 transitions, 5005 flow, removed 176 selfloop flow, removed 5 redundant places. [2024-06-03 19:04:25,264 INFO L231 Difference]: Finished difference. Result has 152 places, 338 transitions, 4257 flow [2024-06-03 19:04:25,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4166, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4257, PETRI_PLACES=152, PETRI_TRANSITIONS=338} [2024-06-03 19:04:25,265 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 107 predicate places. [2024-06-03 19:04:25,265 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 338 transitions, 4257 flow [2024-06-03 19:04:25,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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) [2024-06-03 19:04:25,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:25,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:25,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 19:04:25,266 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:25,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -16943856, now seen corresponding path program 1 times [2024-06-03 19:04:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850495001] [2024-06-03 19:04:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850495001] [2024-06-03 19:04:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850495001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135429494] [2024-06-03 19:04:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:26,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:26,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:26,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-03 19:04:26,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 338 transitions, 4257 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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) [2024-06-03 19:04:26,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:26,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-03 19:04:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:27,562 INFO L124 PetriNetUnfolderBase]: 3585/5367 cut-off events. [2024-06-03 19:04:27,563 INFO L125 PetriNetUnfolderBase]: For 175707/175732 co-relation queries the response was YES. [2024-06-03 19:04:27,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37176 conditions, 5367 events. 3585/5367 cut-off events. For 175707/175732 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 27260 event pairs, 1449 based on Foata normal form. 4/5343 useless extension candidates. Maximal degree in co-relation 37106. Up to 5142 conditions per place. [2024-06-03 19:04:27,604 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 342 selfloop transitions, 19 changer transitions 0/366 dead transitions. [2024-06-03 19:04:27,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 366 transitions, 5136 flow [2024-06-03 19:04:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:04:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:04:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 19:04:27,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-03 19:04:27,606 INFO L175 Difference]: Start difference. First operand has 152 places, 338 transitions, 4257 flow. Second operand 8 states and 143 transitions. [2024-06-03 19:04:27,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 366 transitions, 5136 flow [2024-06-03 19:04:27,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 366 transitions, 4980 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-03 19:04:27,809 INFO L231 Difference]: Finished difference. Result has 154 places, 343 transitions, 4235 flow [2024-06-03 19:04:27,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4105, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4235, PETRI_PLACES=154, PETRI_TRANSITIONS=343} [2024-06-03 19:04:27,810 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 109 predicate places. [2024-06-03 19:04:27,810 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 343 transitions, 4235 flow [2024-06-03 19:04:27,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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) [2024-06-03 19:04:27,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:27,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:27,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 19:04:27,811 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:27,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 718833524, now seen corresponding path program 1 times [2024-06-03 19:04:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:27,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865395832] [2024-06-03 19:04:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:28,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865395832] [2024-06-03 19:04:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865395832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:28,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:28,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:04:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982535903] [2024-06-03 19:04:28,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:28,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:04:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:28,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:04:28,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:04:28,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:28,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 343 transitions, 4235 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2024-06-03 19:04:28,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:28,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:28,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:29,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([418] L781-->L788: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_58 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_61 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_93 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_75 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd1~0_60 (ite .cse0 0 v_~z$r_buff0_thd1~0_61)) (= v_~z$w_buff0_used~0_93 (ite .cse1 0 v_~z$w_buff0_used~0_94)) (= (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_75) v_~z$w_buff1_used~0_74) (= (ite .cse1 v_~z$w_buff0~0_42 (ite .cse2 v_~z$w_buff1~0_41 v_~z~0_61)) v_~z~0_60) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd1~0_60 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_58) v_~z$r_buff1_thd1~0_57)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_61} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_60, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][94], [Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 285#true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, 14#L798true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 249#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 20#L788true, 44#$Ultimate##0true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L870true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-03 19:04:29,115 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-03 19:04:29,116 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-03 19:04:29,116 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-03 19:04:29,116 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-03 19:04:29,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L819-->L821: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][246], [30#L821true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 285#true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, 14#L798true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 249#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 24#L781true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L870true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-03 19:04:29,132 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-03 19:04:29,132 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-03 19:04:29,132 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-03 19:04:29,133 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-03 19:04:29,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L819-->L821: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][249], [30#L821true, Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 285#true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 11#L801true, 249#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 24#L781true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L870true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-03 19:04:29,241 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-03 19:04:29,241 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-03 19:04:29,241 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-03 19:04:29,241 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-03 19:04:29,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([418] L781-->L788: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd1~0_58 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_61 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_93 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_75 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd1~0_60 (ite .cse0 0 v_~z$r_buff0_thd1~0_61)) (= v_~z$w_buff0_used~0_93 (ite .cse1 0 v_~z$w_buff0_used~0_94)) (= (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_75) v_~z$w_buff1_used~0_74) (= (ite .cse1 v_~z$w_buff0~0_42 (ite .cse2 v_~z$w_buff1~0_41 v_~z~0_61)) v_~z~0_60) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd1~0_60 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_58) v_~z$r_buff1_thd1~0_57)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_61, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_61} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$w_buff1~0=v_~z$w_buff1~0_41, ~z~0=v_~z~0_60, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][131], [Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 285#true, Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 11#L801true, Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 249#true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 20#L788true, 44#$Ultimate##0true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 22#L870true, Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-03 19:04:29,244 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-03 19:04:29,244 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-03 19:04:29,244 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-03 19:04:29,245 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-03 19:04:29,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L870-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_7| 0)))) (or (and (or (< v_~x~0_9 0) (and (not (= v_~x~0_9 1)) (not (= v_~x~0_9 0))) (< 1 v_~x~0_9)) .cse0) (and (not (= (mod v_~z$r_buff0_thd0~0_7 256) 0)) .cse0) (and (< v_~__unbuffered_cnt~0_12 0) .cse0) (and (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0)) .cse0) (and (or (not (= v_~z$read_delayed_var~0.offset_6 0)) (not (= v_~z$read_delayed_var~0.base_6 0))) .cse0) (and (not (= (mod v_~z$read_delayed~0_6 256) 0)) .cse0) (and .cse0 (or (and (not (= v_~__unbuffered_p1_EAX~0_7 0)) (not (= v_~__unbuffered_p1_EAX~0_7 1))) (< v_~__unbuffered_p1_EAX~0_7 0) (< 1 v_~__unbuffered_p1_EAX~0_7))) (and (or (and (not (= v_~z$mem_tmp~0_10 0)) (not (= v_~z$mem_tmp~0_10 1))) (< 1 v_~z$mem_tmp~0_10) (< v_~z$mem_tmp~0_10 0)) .cse0) (and .cse0 (not (= (mod v_~z$r_buff1_thd2~0_11 256) 0))) (and (or (< v_~z$w_buff0~0_17 0) (and (not (= v_~z$w_buff0~0_17 0)) (not (= v_~z$w_buff0~0_17 1))) (< 1 v_~z$w_buff0~0_17)) .cse0) (and (or (< 1 v_~__unbuffered_p2_EAX~0_7) (and (not (= v_~__unbuffered_p2_EAX~0_7 1)) (not (= v_~__unbuffered_p2_EAX~0_7 0))) (< v_~__unbuffered_p2_EAX~0_7 0)) .cse0) (and (or (< v_~__unbuffered_p0_EBX~0_7 0) (< 1 v_~__unbuffered_p0_EBX~0_7) (and (not (= v_~__unbuffered_p0_EBX~0_7 1)) (not (= v_~__unbuffered_p0_EBX~0_7 0)))) .cse0) (and (or (and (not (= v_~__unbuffered_p1_EBX~0_7 1)) (not (= v_~__unbuffered_p1_EBX~0_7 0))) (< v_~__unbuffered_p1_EBX~0_7 0) (< 1 v_~__unbuffered_p1_EBX~0_7)) .cse0) (and (or (and (not (= v_~__unbuffered_p2_EBX~0_7 1)) (not (= v_~__unbuffered_p2_EBX~0_7 0))) (< 1 v_~__unbuffered_p2_EBX~0_7) (< v_~__unbuffered_p2_EBX~0_7 0)) .cse0) (and .cse0 (not (= (mod v_~z$r_buff1_thd3~0_19 256) 0))) (and (not (= (mod v_~z$r_buff1_thd0~0_7 256) 0)) .cse0) (and (or (< v_~__unbuffered_p0_EAX~0_7 0) (and (not (= v_~__unbuffered_p0_EAX~0_7 1)) (not (= v_~__unbuffered_p0_EAX~0_7 0))) (< 1 v_~__unbuffered_p0_EAX~0_7)) .cse0) (and (not (= (mod v_~z$r_buff0_thd2~0_13 256) 0)) .cse0) (and (or (< v_~z~0_24 0) (< 1 v_~z~0_24) (and (not (= v_~z~0_24 0)) (not (= v_~z~0_24 1)))) .cse0) (and (or (< 1 v_~z$w_buff1~0_16) (< v_~z$w_buff1~0_16 0) (and (not (= v_~z$w_buff1~0_16 0)) (not (= v_~z$w_buff1~0_16 1)))) .cse0) (and (or (< 1 v_~y~0_9) (< v_~y~0_9 0) (and (not (= v_~y~0_9 1)) (not (= v_~y~0_9 0)))) .cse0) (and (not (= (mod v_~z$flush_delayed~0_12 256) 0)) .cse0))) InVars {~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_24, ~x~0=v_~x~0_9} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_24, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[][198], [Black: 255#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 257#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 254#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 252#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 131#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 392#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 237#true, 265#true, Black: 144#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 277#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 269#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 275#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 279#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 406#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 318#true, Black: 270#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z~0 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 157#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), 285#true, Black: 155#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 442#true, Black: 289#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 420#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 291#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 292#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 148#true, Black: 293#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 295#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 461#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 178#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork1InUse, Black: 434#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 308#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 249#true, 11#L801true, Black: 309#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 311#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 305#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 64#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 24#L781true, 44#$Ultimate##0true, Black: 191#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 70#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (or (= ~z~0 1) (= ~z~0 0))) (and (= ~__unbuffered_p0_EAX~0 0) (= ~z~0 0))) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 137#true, Black: 450#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 456#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 90#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 99#(and (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (and (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1))) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 356#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 231#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 38#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 115#true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$r_buff1_thd2~0 (* 256 (div ~z$r_buff1_thd2~0 256))) (= ~z$r_buff1_thd3~0 (* 256 (div ~z$r_buff1_thd3~0 256))) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 368#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1)) (= ~z~0 0)) (= ~z$read_delayed_var~0.base 0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~__unbuffered_p0_EAX~0 0)) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 245#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p0_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (= ~__unbuffered_p0_EAX~0 1) (= ~z~0 0)) (= ~__unbuffered_p0_EAX~0 ~z~0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 121#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 380#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~__unbuffered_p1_EAX~0 1) (= ~z$w_buff1~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~z~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z~0 1) (= ~__unbuffered_p0_EAX~0 1) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1))]) [2024-06-03 19:04:29,246 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-06-03 19:04:29,246 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-03 19:04:29,246 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-03 19:04:29,247 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-06-03 19:04:29,644 INFO L124 PetriNetUnfolderBase]: 3333/5103 cut-off events. [2024-06-03 19:04:29,644 INFO L125 PetriNetUnfolderBase]: For 183727/183902 co-relation queries the response was YES. [2024-06-03 19:04:29,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34872 conditions, 5103 events. 3333/5103 cut-off events. For 183727/183902 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 27062 event pairs, 1494 based on Foata normal form. 38/5081 useless extension candidates. Maximal degree in co-relation 34800. Up to 4642 conditions per place. [2024-06-03 19:04:29,688 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 246 selfloop transitions, 12 changer transitions 0/356 dead transitions. [2024-06-03 19:04:29,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 356 transitions, 4807 flow [2024-06-03 19:04:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:04:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:04:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-03 19:04:29,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-03 19:04:29,689 INFO L175 Difference]: Start difference. First operand has 154 places, 343 transitions, 4235 flow. Second operand 6 states and 110 transitions. [2024-06-03 19:04:29,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 356 transitions, 4807 flow [2024-06-03 19:04:29,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 356 transitions, 4732 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-03 19:04:29,892 INFO L231 Difference]: Finished difference. Result has 155 places, 346 transitions, 4224 flow [2024-06-03 19:04:29,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4160, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4224, PETRI_PLACES=155, PETRI_TRANSITIONS=346} [2024-06-03 19:04:29,892 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 110 predicate places. [2024-06-03 19:04:29,892 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 346 transitions, 4224 flow [2024-06-03 19:04:29,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2024-06-03 19:04:29,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:29,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:29,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 19:04:29,893 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:29,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash 317636695, now seen corresponding path program 1 times [2024-06-03 19:04:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:29,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407431911] [2024-06-03 19:04:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407431911] [2024-06-03 19:04:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407431911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:30,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:04:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546333948] [2024-06-03 19:04:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:30,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:04:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:30,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:04:30,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:04:31,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:31,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 346 transitions, 4224 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:31,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:31,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:31,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:32,070 INFO L124 PetriNetUnfolderBase]: 3281/5042 cut-off events. [2024-06-03 19:04:32,071 INFO L125 PetriNetUnfolderBase]: For 189246/189294 co-relation queries the response was YES. [2024-06-03 19:04:32,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36164 conditions, 5042 events. 3281/5042 cut-off events. For 189246/189294 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 27115 event pairs, 1134 based on Foata normal form. 30/5045 useless extension candidates. Maximal degree in co-relation 36091. Up to 4334 conditions per place. [2024-06-03 19:04:32,121 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 278 selfloop transitions, 110 changer transitions 0/395 dead transitions. [2024-06-03 19:04:32,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 395 transitions, 5408 flow [2024-06-03 19:04:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:04:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:04:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-06-03 19:04:32,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-06-03 19:04:32,123 INFO L175 Difference]: Start difference. First operand has 155 places, 346 transitions, 4224 flow. Second operand 10 states and 205 transitions. [2024-06-03 19:04:32,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 395 transitions, 5408 flow [2024-06-03 19:04:32,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 395 transitions, 5366 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-03 19:04:32,332 INFO L231 Difference]: Finished difference. Result has 161 places, 352 transitions, 4533 flow [2024-06-03 19:04:32,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4182, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4533, PETRI_PLACES=161, PETRI_TRANSITIONS=352} [2024-06-03 19:04:32,333 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 116 predicate places. [2024-06-03 19:04:32,333 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 352 transitions, 4533 flow [2024-06-03 19:04:32,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:32,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:32,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:32,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 19:04:32,333 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:32,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -84048640, now seen corresponding path program 1 times [2024-06-03 19:04:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468347762] [2024-06-03 19:04:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468347762] [2024-06-03 19:04:33,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468347762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:33,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:33,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:33,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075791285] [2024-06-03 19:04:33,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:33,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:33,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:33,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:33,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:33,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 352 transitions, 4533 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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) [2024-06-03 19:04:33,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:33,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:33,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:34,644 INFO L124 PetriNetUnfolderBase]: 3378/5162 cut-off events. [2024-06-03 19:04:34,644 INFO L125 PetriNetUnfolderBase]: For 207423/207462 co-relation queries the response was YES. [2024-06-03 19:04:34,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38170 conditions, 5162 events. 3378/5162 cut-off events. For 207423/207462 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 27645 event pairs, 1106 based on Foata normal form. 11/5147 useless extension candidates. Maximal degree in co-relation 38096. Up to 4710 conditions per place. [2024-06-03 19:04:34,694 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 349 selfloop transitions, 62 changer transitions 0/418 dead transitions. [2024-06-03 19:04:34,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 418 transitions, 5964 flow [2024-06-03 19:04:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:04:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:04:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-06-03 19:04:34,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4462809917355372 [2024-06-03 19:04:34,696 INFO L175 Difference]: Start difference. First operand has 161 places, 352 transitions, 4533 flow. Second operand 11 states and 216 transitions. [2024-06-03 19:04:34,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 418 transitions, 5964 flow [2024-06-03 19:04:34,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 418 transitions, 5781 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-03 19:04:34,940 INFO L231 Difference]: Finished difference. Result has 168 places, 373 transitions, 4786 flow [2024-06-03 19:04:34,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4352, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4786, PETRI_PLACES=168, PETRI_TRANSITIONS=373} [2024-06-03 19:04:34,941 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 123 predicate places. [2024-06-03 19:04:34,941 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 373 transitions, 4786 flow [2024-06-03 19:04:34,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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) [2024-06-03 19:04:34,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:34,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:34,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 19:04:34,941 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:34,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:34,942 INFO L85 PathProgramCache]: Analyzing trace with hash 532439057, now seen corresponding path program 2 times [2024-06-03 19:04:34,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:34,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153206927] [2024-06-03 19:04:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:34,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:35,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153206927] [2024-06-03 19:04:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153206927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:35,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:04:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474558775] [2024-06-03 19:04:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:35,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:04:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:04:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:04:36,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:36,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 373 transitions, 4786 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:36,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:36,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:36,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:37,659 INFO L124 PetriNetUnfolderBase]: 3532/5407 cut-off events. [2024-06-03 19:04:37,659 INFO L125 PetriNetUnfolderBase]: For 233548/233589 co-relation queries the response was YES. [2024-06-03 19:04:37,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41061 conditions, 5407 events. 3532/5407 cut-off events. For 233548/233589 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 29319 event pairs, 1078 based on Foata normal form. 17/5398 useless extension candidates. Maximal degree in co-relation 40983. Up to 4785 conditions per place. [2024-06-03 19:04:37,700 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 363 selfloop transitions, 68 changer transitions 0/438 dead transitions. [2024-06-03 19:04:37,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 438 transitions, 6296 flow [2024-06-03 19:04:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 19:04:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 19:04:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-03 19:04:37,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45265151515151514 [2024-06-03 19:04:37,702 INFO L175 Difference]: Start difference. First operand has 168 places, 373 transitions, 4786 flow. Second operand 12 states and 239 transitions. [2024-06-03 19:04:37,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 438 transitions, 6296 flow [2024-06-03 19:04:37,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 438 transitions, 6149 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-03 19:04:37,915 INFO L231 Difference]: Finished difference. Result has 177 places, 383 transitions, 5016 flow [2024-06-03 19:04:37,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4639, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5016, PETRI_PLACES=177, PETRI_TRANSITIONS=383} [2024-06-03 19:04:37,916 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 132 predicate places. [2024-06-03 19:04:37,916 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 383 transitions, 5016 flow [2024-06-03 19:04:37,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:37,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:37,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:37,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 19:04:37,917 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:37,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1334810188, now seen corresponding path program 2 times [2024-06-03 19:04:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004853513] [2024-06-03 19:04:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:39,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:39,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004853513] [2024-06-03 19:04:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004853513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:39,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097656610] [2024-06-03 19:04:39,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:39,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:39,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:39,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:39,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 383 transitions, 5016 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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) [2024-06-03 19:04:39,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:39,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:39,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:40,396 INFO L124 PetriNetUnfolderBase]: 3612/5523 cut-off events. [2024-06-03 19:04:40,396 INFO L125 PetriNetUnfolderBase]: For 241300/241335 co-relation queries the response was YES. [2024-06-03 19:04:40,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42602 conditions, 5523 events. 3612/5523 cut-off events. For 241300/241335 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 29955 event pairs, 1154 based on Foata normal form. 12/5511 useless extension candidates. Maximal degree in co-relation 42521. Up to 5032 conditions per place. [2024-06-03 19:04:40,446 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 368 selfloop transitions, 69 changer transitions 0/444 dead transitions. [2024-06-03 19:04:40,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 444 transitions, 6360 flow [2024-06-03 19:04:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:04:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:04:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-03 19:04:40,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-03 19:04:40,450 INFO L175 Difference]: Start difference. First operand has 177 places, 383 transitions, 5016 flow. Second operand 9 states and 180 transitions. [2024-06-03 19:04:40,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 444 transitions, 6360 flow [2024-06-03 19:04:40,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 444 transitions, 6152 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-03 19:04:40,804 INFO L231 Difference]: Finished difference. Result has 180 places, 410 transitions, 5349 flow [2024-06-03 19:04:40,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4833, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5349, PETRI_PLACES=180, PETRI_TRANSITIONS=410} [2024-06-03 19:04:40,805 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 135 predicate places. [2024-06-03 19:04:40,805 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 410 transitions, 5349 flow [2024-06-03 19:04:40,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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) [2024-06-03 19:04:40,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:40,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:40,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 19:04:40,806 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:40,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:40,806 INFO L85 PathProgramCache]: Analyzing trace with hash -203938397, now seen corresponding path program 3 times [2024-06-03 19:04:40,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:40,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970033699] [2024-06-03 19:04:40,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:40,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:41,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970033699] [2024-06-03 19:04:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970033699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:41,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:04:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720415312] [2024-06-03 19:04:41,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:41,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:04:41,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:04:41,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:04:41,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:41,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 410 transitions, 5349 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:41,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:41,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:41,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:43,253 INFO L124 PetriNetUnfolderBase]: 3712/5690 cut-off events. [2024-06-03 19:04:43,254 INFO L125 PetriNetUnfolderBase]: For 256281/256316 co-relation queries the response was YES. [2024-06-03 19:04:43,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43595 conditions, 5690 events. 3712/5690 cut-off events. For 256281/256316 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 31135 event pairs, 1153 based on Foata normal form. 21/5691 useless extension candidates. Maximal degree in co-relation 43511. Up to 5078 conditions per place. [2024-06-03 19:04:43,311 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 374 selfloop transitions, 78 changer transitions 0/459 dead transitions. [2024-06-03 19:04:43,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 459 transitions, 6549 flow [2024-06-03 19:04:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:04:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:04:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-03 19:04:43,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2024-06-03 19:04:43,313 INFO L175 Difference]: Start difference. First operand has 180 places, 410 transitions, 5349 flow. Second operand 10 states and 199 transitions. [2024-06-03 19:04:43,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 459 transitions, 6549 flow [2024-06-03 19:04:43,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 459 transitions, 6410 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-06-03 19:04:43,701 INFO L231 Difference]: Finished difference. Result has 186 places, 419 transitions, 5523 flow [2024-06-03 19:04:43,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5210, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5523, PETRI_PLACES=186, PETRI_TRANSITIONS=419} [2024-06-03 19:04:43,701 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 141 predicate places. [2024-06-03 19:04:43,701 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 419 transitions, 5523 flow [2024-06-03 19:04:43,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:43,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:43,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:43,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 19:04:43,702 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:43,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:43,702 INFO L85 PathProgramCache]: Analyzing trace with hash -88890887, now seen corresponding path program 4 times [2024-06-03 19:04:43,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:43,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022934322] [2024-06-03 19:04:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:43,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:44,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022934322] [2024-06-03 19:04:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022934322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:04:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663853104] [2024-06-03 19:04:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:44,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:04:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:44,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:04:44,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:04:44,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:44,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 419 transitions, 5523 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:44,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:44,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:44,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:46,501 INFO L124 PetriNetUnfolderBase]: 3884/5942 cut-off events. [2024-06-03 19:04:46,501 INFO L125 PetriNetUnfolderBase]: For 287174/287239 co-relation queries the response was YES. [2024-06-03 19:04:46,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46397 conditions, 5942 events. 3884/5942 cut-off events. For 287174/287239 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 32998 event pairs, 1018 based on Foata normal form. 22/5921 useless extension candidates. Maximal degree in co-relation 46312. Up to 4611 conditions per place. [2024-06-03 19:04:46,552 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 320 selfloop transitions, 194 changer transitions 0/521 dead transitions. [2024-06-03 19:04:46,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 521 transitions, 7873 flow [2024-06-03 19:04:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:04:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:04:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2024-06-03 19:04:46,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2024-06-03 19:04:46,553 INFO L175 Difference]: Start difference. First operand has 186 places, 419 transitions, 5523 flow. Second operand 10 states and 212 transitions. [2024-06-03 19:04:46,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 521 transitions, 7873 flow [2024-06-03 19:04:46,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 521 transitions, 7618 flow, removed 52 selfloop flow, removed 8 redundant places. [2024-06-03 19:04:46,918 INFO L231 Difference]: Finished difference. Result has 192 places, 466 transitions, 6582 flow [2024-06-03 19:04:46,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5322, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6582, PETRI_PLACES=192, PETRI_TRANSITIONS=466} [2024-06-03 19:04:46,921 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 147 predicate places. [2024-06-03 19:04:46,921 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 466 transitions, 6582 flow [2024-06-03 19:04:46,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:46,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:46,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:46,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 19:04:46,921 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:46,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash -432977092, now seen corresponding path program 3 times [2024-06-03 19:04:46,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:46,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474870419] [2024-06-03 19:04:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474870419] [2024-06-03 19:04:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474870419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:48,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:04:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800835865] [2024-06-03 19:04:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:48,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:04:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:04:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:04:48,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:48,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 466 transitions, 6582 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:48,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:48,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:48,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:50,371 INFO L124 PetriNetUnfolderBase]: 3892/5950 cut-off events. [2024-06-03 19:04:50,371 INFO L125 PetriNetUnfolderBase]: For 298346/298421 co-relation queries the response was YES. [2024-06-03 19:04:50,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48601 conditions, 5950 events. 3892/5950 cut-off events. For 298346/298421 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 32885 event pairs, 1072 based on Foata normal form. 20/5938 useless extension candidates. Maximal degree in co-relation 48511. Up to 5247 conditions per place. [2024-06-03 19:04:50,427 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 377 selfloop transitions, 132 changer transitions 0/516 dead transitions. [2024-06-03 19:04:50,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 516 transitions, 7961 flow [2024-06-03 19:04:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:04:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:04:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-03 19:04:50,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-06-03 19:04:50,429 INFO L175 Difference]: Start difference. First operand has 192 places, 466 transitions, 6582 flow. Second operand 10 states and 197 transitions. [2024-06-03 19:04:50,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 516 transitions, 7961 flow [2024-06-03 19:04:50,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 516 transitions, 7786 flow, removed 60 selfloop flow, removed 3 redundant places. [2024-06-03 19:04:50,894 INFO L231 Difference]: Finished difference. Result has 200 places, 480 transitions, 6933 flow [2024-06-03 19:04:50,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6409, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6933, PETRI_PLACES=200, PETRI_TRANSITIONS=480} [2024-06-03 19:04:50,896 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 155 predicate places. [2024-06-03 19:04:50,897 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 480 transitions, 6933 flow [2024-06-03 19:04:50,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:50,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:50,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:50,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 19:04:50,898 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:50,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash -432971357, now seen corresponding path program 5 times [2024-06-03 19:04:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695335883] [2024-06-03 19:04:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695335883] [2024-06-03 19:04:52,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695335883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:52,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:52,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:04:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387298105] [2024-06-03 19:04:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:52,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:04:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:04:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:04:52,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:52,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 480 transitions, 6933 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:52,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:52,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:52,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:53,931 INFO L124 PetriNetUnfolderBase]: 3885/5951 cut-off events. [2024-06-03 19:04:53,932 INFO L125 PetriNetUnfolderBase]: For 320231/320309 co-relation queries the response was YES. [2024-06-03 19:04:53,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49656 conditions, 5951 events. 3885/5951 cut-off events. For 320231/320309 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 33146 event pairs, 1008 based on Foata normal form. 28/5936 useless extension candidates. Maximal degree in co-relation 49563. Up to 4619 conditions per place. [2024-06-03 19:04:54,000 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 316 selfloop transitions, 200 changer transitions 0/523 dead transitions. [2024-06-03 19:04:54,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 523 transitions, 8397 flow [2024-06-03 19:04:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:04:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:04:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-03 19:04:54,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-06-03 19:04:54,002 INFO L175 Difference]: Start difference. First operand has 200 places, 480 transitions, 6933 flow. Second operand 10 states and 208 transitions. [2024-06-03 19:04:54,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 523 transitions, 8397 flow [2024-06-03 19:04:54,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 523 transitions, 8106 flow, removed 65 selfloop flow, removed 6 redundant places. [2024-06-03 19:04:54,604 INFO L231 Difference]: Finished difference. Result has 204 places, 480 transitions, 7052 flow [2024-06-03 19:04:54,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6642, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7052, PETRI_PLACES=204, PETRI_TRANSITIONS=480} [2024-06-03 19:04:54,605 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 159 predicate places. [2024-06-03 19:04:54,606 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 480 transitions, 7052 flow [2024-06-03 19:04:54,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:54,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:54,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:54,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 19:04:54,606 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:54,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1906796228, now seen corresponding path program 4 times [2024-06-03 19:04:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306307188] [2024-06-03 19:04:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:55,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:55,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306307188] [2024-06-03 19:04:55,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306307188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:55,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:55,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:04:55,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050129978] [2024-06-03 19:04:55,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:55,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:04:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:04:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:04:55,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:55,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 480 transitions, 7052 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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) [2024-06-03 19:04:55,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:55,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:04:57,287 INFO L124 PetriNetUnfolderBase]: 3998/6116 cut-off events. [2024-06-03 19:04:57,287 INFO L125 PetriNetUnfolderBase]: For 329264/329339 co-relation queries the response was YES. [2024-06-03 19:04:57,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51178 conditions, 6116 events. 3998/6116 cut-off events. For 329264/329339 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 34006 event pairs, 1192 based on Foata normal form. 15/6099 useless extension candidates. Maximal degree in co-relation 51086. Up to 5648 conditions per place. [2024-06-03 19:04:57,358 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 485 selfloop transitions, 61 changer transitions 0/553 dead transitions. [2024-06-03 19:04:57,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 553 transitions, 8904 flow [2024-06-03 19:04:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:04:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:04:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-03 19:04:57,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-03 19:04:57,360 INFO L175 Difference]: Start difference. First operand has 204 places, 480 transitions, 7052 flow. Second operand 9 states and 174 transitions. [2024-06-03 19:04:57,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 553 transitions, 8904 flow [2024-06-03 19:04:57,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 553 transitions, 8467 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 19:04:57,903 INFO L231 Difference]: Finished difference. Result has 207 places, 516 transitions, 7410 flow [2024-06-03 19:04:57,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6651, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7410, PETRI_PLACES=207, PETRI_TRANSITIONS=516} [2024-06-03 19:04:57,904 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 162 predicate places. [2024-06-03 19:04:57,904 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 516 transitions, 7410 flow [2024-06-03 19:04:57,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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) [2024-06-03 19:04:57,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:04:57,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:04:57,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 19:04:57,905 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:04:57,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:04:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1906705863, now seen corresponding path program 6 times [2024-06-03 19:04:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:04:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666966744] [2024-06-03 19:04:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:04:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:04:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:04:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:04:58,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:04:58,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666966744] [2024-06-03 19:04:58,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666966744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:04:58,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:04:58,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:04:58,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539897278] [2024-06-03 19:04:58,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:04:58,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:04:58,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:04:58,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:04:58,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:04:59,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:04:59,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 516 transitions, 7410 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:04:59,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:04:59,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:04:59,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:00,553 INFO L124 PetriNetUnfolderBase]: 4133/6333 cut-off events. [2024-06-03 19:05:00,553 INFO L125 PetriNetUnfolderBase]: For 351302/351377 co-relation queries the response was YES. [2024-06-03 19:05:00,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52368 conditions, 6333 events. 4133/6333 cut-off events. For 351302/351377 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 35576 event pairs, 1206 based on Foata normal form. 25/6326 useless extension candidates. Maximal degree in co-relation 52273. Up to 5713 conditions per place. [2024-06-03 19:05:00,625 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 496 selfloop transitions, 80 changer transitions 0/583 dead transitions. [2024-06-03 19:05:00,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 583 transitions, 9165 flow [2024-06-03 19:05:00,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:05:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:05:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-03 19:05:00,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-06-03 19:05:00,626 INFO L175 Difference]: Start difference. First operand has 207 places, 516 transitions, 7410 flow. Second operand 10 states and 193 transitions. [2024-06-03 19:05:00,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 583 transitions, 9165 flow [2024-06-03 19:05:01,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 583 transitions, 9012 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-03 19:05:01,237 INFO L231 Difference]: Finished difference. Result has 213 places, 535 transitions, 7787 flow [2024-06-03 19:05:01,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7265, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7787, PETRI_PLACES=213, PETRI_TRANSITIONS=535} [2024-06-03 19:05:01,238 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 168 predicate places. [2024-06-03 19:05:01,238 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 535 transitions, 7787 flow [2024-06-03 19:05:01,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:01,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:01,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 19:05:01,239 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:01,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash -131384653, now seen corresponding path program 7 times [2024-06-03 19:05:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903640133] [2024-06-03 19:05:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:02,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:02,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903640133] [2024-06-03 19:05:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903640133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:02,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:02,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:02,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974316711] [2024-06-03 19:05:02,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:02,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:02,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:02,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:02,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:02,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 535 transitions, 7787 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:02,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:02,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:02,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:03,807 INFO L124 PetriNetUnfolderBase]: 4430/6786 cut-off events. [2024-06-03 19:05:03,808 INFO L125 PetriNetUnfolderBase]: For 392995/393033 co-relation queries the response was YES. [2024-06-03 19:05:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57198 conditions, 6786 events. 4430/6786 cut-off events. For 392995/393033 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 38796 event pairs, 1208 based on Foata normal form. 30/6778 useless extension candidates. Maximal degree in co-relation 57102. Up to 5234 conditions per place. [2024-06-03 19:05:03,890 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 416 selfloop transitions, 241 changer transitions 0/664 dead transitions. [2024-06-03 19:05:03,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 664 transitions, 11004 flow [2024-06-03 19:05:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:05:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:05:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2024-06-03 19:05:03,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48409090909090907 [2024-06-03 19:05:03,892 INFO L175 Difference]: Start difference. First operand has 213 places, 535 transitions, 7787 flow. Second operand 10 states and 213 transitions. [2024-06-03 19:05:03,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 664 transitions, 11004 flow [2024-06-03 19:05:04,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 664 transitions, 10784 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-03 19:05:04,636 INFO L231 Difference]: Finished difference. Result has 219 places, 573 transitions, 9044 flow [2024-06-03 19:05:04,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7567, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9044, PETRI_PLACES=219, PETRI_TRANSITIONS=573} [2024-06-03 19:05:04,636 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 174 predicate places. [2024-06-03 19:05:04,637 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 573 transitions, 9044 flow [2024-06-03 19:05:04,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:04,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:04,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:04,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 19:05:04,638 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:04,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1902986948, now seen corresponding path program 5 times [2024-06-03 19:05:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:04,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166256804] [2024-06-03 19:05:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:06,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166256804] [2024-06-03 19:05:06,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166256804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:06,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:06,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135980591] [2024-06-03 19:05:06,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:06,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:06,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:06,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 573 transitions, 9044 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:06,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:06,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:06,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:07,973 INFO L124 PetriNetUnfolderBase]: 4425/6781 cut-off events. [2024-06-03 19:05:07,973 INFO L125 PetriNetUnfolderBase]: For 410318/410335 co-relation queries the response was YES. [2024-06-03 19:05:08,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59036 conditions, 6781 events. 4425/6781 cut-off events. For 410318/410335 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 38804 event pairs, 1211 based on Foata normal form. 6/6748 useless extension candidates. Maximal degree in co-relation 58937. Up to 6082 conditions per place. [2024-06-03 19:05:08,057 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 493 selfloop transitions, 126 changer transitions 0/626 dead transitions. [2024-06-03 19:05:08,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 626 transitions, 10682 flow [2024-06-03 19:05:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:05:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:05:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-03 19:05:08,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-03 19:05:08,058 INFO L175 Difference]: Start difference. First operand has 219 places, 573 transitions, 9044 flow. Second operand 9 states and 180 transitions. [2024-06-03 19:05:08,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 626 transitions, 10682 flow [2024-06-03 19:05:08,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 626 transitions, 10371 flow, removed 117 selfloop flow, removed 4 redundant places. [2024-06-03 19:05:08,819 INFO L231 Difference]: Finished difference. Result has 225 places, 579 transitions, 9126 flow [2024-06-03 19:05:08,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8733, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9126, PETRI_PLACES=225, PETRI_TRANSITIONS=579} [2024-06-03 19:05:08,820 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 180 predicate places. [2024-06-03 19:05:08,820 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 579 transitions, 9126 flow [2024-06-03 19:05:08,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:08,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:08,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:08,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 19:05:08,821 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:08,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash -47898875, now seen corresponding path program 8 times [2024-06-03 19:05:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432169565] [2024-06-03 19:05:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432169565] [2024-06-03 19:05:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432169565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078444117] [2024-06-03 19:05:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:09,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:09,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:09,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:09,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:10,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:10,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 579 transitions, 9126 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:10,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:10,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:10,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:11,672 INFO L124 PetriNetUnfolderBase]: 4399/6741 cut-off events. [2024-06-03 19:05:11,673 INFO L125 PetriNetUnfolderBase]: For 415227/415265 co-relation queries the response was YES. [2024-06-03 19:05:11,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58286 conditions, 6741 events. 4399/6741 cut-off events. For 415227/415265 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 38443 event pairs, 1202 based on Foata normal form. 30/6733 useless extension candidates. Maximal degree in co-relation 58184. Up to 5216 conditions per place. [2024-06-03 19:05:11,755 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 425 selfloop transitions, 233 changer transitions 0/665 dead transitions. [2024-06-03 19:05:11,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 665 transitions, 11309 flow [2024-06-03 19:05:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:05:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:05:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2024-06-03 19:05:11,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47954545454545455 [2024-06-03 19:05:11,757 INFO L175 Difference]: Start difference. First operand has 225 places, 579 transitions, 9126 flow. Second operand 10 states and 211 transitions. [2024-06-03 19:05:11,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 665 transitions, 11309 flow [2024-06-03 19:05:12,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 665 transitions, 10985 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-03 19:05:12,528 INFO L231 Difference]: Finished difference. Result has 228 places, 579 transitions, 9285 flow [2024-06-03 19:05:12,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8802, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9285, PETRI_PLACES=228, PETRI_TRANSITIONS=579} [2024-06-03 19:05:12,528 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 183 predicate places. [2024-06-03 19:05:12,529 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 579 transitions, 9285 flow [2024-06-03 19:05:12,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:12,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:12,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:12,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 19:05:12,529 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:12,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash 317844085, now seen corresponding path program 9 times [2024-06-03 19:05:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:12,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120099958] [2024-06-03 19:05:12,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:12,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:13,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:13,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120099958] [2024-06-03 19:05:13,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120099958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:13,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:13,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915293462] [2024-06-03 19:05:13,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:13,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:13,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:13,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:13,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:13,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:13,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 579 transitions, 9285 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:13,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:13,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:13,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:15,456 INFO L124 PetriNetUnfolderBase]: 4457/6825 cut-off events. [2024-06-03 19:05:15,456 INFO L125 PetriNetUnfolderBase]: For 435168/435215 co-relation queries the response was YES. [2024-06-03 19:05:15,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59649 conditions, 6825 events. 4457/6825 cut-off events. For 435168/435215 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 39021 event pairs, 1232 based on Foata normal form. 42/6831 useless extension candidates. Maximal degree in co-relation 59546. Up to 6171 conditions per place. [2024-06-03 19:05:15,540 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 532 selfloop transitions, 88 changer transitions 0/627 dead transitions. [2024-06-03 19:05:15,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 627 transitions, 10921 flow [2024-06-03 19:05:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:05:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:05:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-03 19:05:15,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 19:05:15,542 INFO L175 Difference]: Start difference. First operand has 228 places, 579 transitions, 9285 flow. Second operand 10 states and 198 transitions. [2024-06-03 19:05:15,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 627 transitions, 10921 flow [2024-06-03 19:05:16,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 627 transitions, 10354 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-03 19:05:16,323 INFO L231 Difference]: Finished difference. Result has 229 places, 585 transitions, 9070 flow [2024-06-03 19:05:16,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8730, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9070, PETRI_PLACES=229, PETRI_TRANSITIONS=585} [2024-06-03 19:05:16,323 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 184 predicate places. [2024-06-03 19:05:16,323 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 585 transitions, 9070 flow [2024-06-03 19:05:16,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:16,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:16,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:16,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 19:05:16,325 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:16,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash -42530915, now seen corresponding path program 10 times [2024-06-03 19:05:16,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:16,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423008521] [2024-06-03 19:05:16,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:16,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423008521] [2024-06-03 19:05:17,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423008521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:17,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:17,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573164931] [2024-06-03 19:05:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:17,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:17,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:17,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:17,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 585 transitions, 9070 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:17,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:17,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:17,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:19,102 INFO L124 PetriNetUnfolderBase]: 4431/6789 cut-off events. [2024-06-03 19:05:19,103 INFO L125 PetriNetUnfolderBase]: For 438925/438972 co-relation queries the response was YES. [2024-06-03 19:05:19,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58700 conditions, 6789 events. 4431/6789 cut-off events. For 438925/438972 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 38794 event pairs, 1225 based on Foata normal form. 42/6795 useless extension candidates. Maximal degree in co-relation 58596. Up to 5919 conditions per place. [2024-06-03 19:05:19,172 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 518 selfloop transitions, 119 changer transitions 0/644 dead transitions. [2024-06-03 19:05:19,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 644 transitions, 10780 flow [2024-06-03 19:05:19,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:05:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:05:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-06-03 19:05:19,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-06-03 19:05:19,176 INFO L175 Difference]: Start difference. First operand has 229 places, 585 transitions, 9070 flow. Second operand 10 states and 205 transitions. [2024-06-03 19:05:19,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 644 transitions, 10780 flow [2024-06-03 19:05:19,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 644 transitions, 10495 flow, removed 60 selfloop flow, removed 8 redundant places. [2024-06-03 19:05:19,890 INFO L231 Difference]: Finished difference. Result has 231 places, 585 transitions, 9038 flow [2024-06-03 19:05:19,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8785, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9038, PETRI_PLACES=231, PETRI_TRANSITIONS=585} [2024-06-03 19:05:19,890 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 186 predicate places. [2024-06-03 19:05:19,890 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 585 transitions, 9038 flow [2024-06-03 19:05:19,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:19,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:19,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:19,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 19:05:19,891 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:19,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2005631771, now seen corresponding path program 1 times [2024-06-03 19:05:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:19,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171993411] [2024-06-03 19:05:19,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:19,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:20,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171993411] [2024-06-03 19:05:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171993411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:20,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:20,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:05:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676082912] [2024-06-03 19:05:20,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:20,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:05:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:20,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:05:20,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:05:20,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:20,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 585 transitions, 9038 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2024-06-03 19:05:20,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:20,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:20,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:22,288 INFO L124 PetriNetUnfolderBase]: 4893/7399 cut-off events. [2024-06-03 19:05:22,288 INFO L125 PetriNetUnfolderBase]: For 486087/486600 co-relation queries the response was YES. [2024-06-03 19:05:22,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63017 conditions, 7399 events. 4893/7399 cut-off events. For 486087/486600 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 41732 event pairs, 1539 based on Foata normal form. 110/7405 useless extension candidates. Maximal degree in co-relation 62912. Up to 6731 conditions per place. [2024-06-03 19:05:22,398 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 446 selfloop transitions, 24 changer transitions 0/609 dead transitions. [2024-06-03 19:05:22,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 609 transitions, 10192 flow [2024-06-03 19:05:22,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:05:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:05:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 19:05:22,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2024-06-03 19:05:22,400 INFO L175 Difference]: Start difference. First operand has 231 places, 585 transitions, 9038 flow. Second operand 7 states and 135 transitions. [2024-06-03 19:05:22,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 609 transitions, 10192 flow [2024-06-03 19:05:23,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 609 transitions, 9913 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 19:05:23,171 INFO L231 Difference]: Finished difference. Result has 229 places, 591 transitions, 8876 flow [2024-06-03 19:05:23,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8759, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8876, PETRI_PLACES=229, PETRI_TRANSITIONS=591} [2024-06-03 19:05:23,171 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 184 predicate places. [2024-06-03 19:05:23,172 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 591 transitions, 8876 flow [2024-06-03 19:05:23,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2024-06-03 19:05:23,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:23,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:23,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 19:05:23,172 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:23,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1539350727, now seen corresponding path program 1 times [2024-06-03 19:05:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755757148] [2024-06-03 19:05:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:24,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:24,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755757148] [2024-06-03 19:05:24,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755757148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:24,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:24,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:05:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384601555] [2024-06-03 19:05:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:24,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:05:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:24,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:05:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:05:25,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:25,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 591 transitions, 8876 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:05:25,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:25,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:25,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:27,084 INFO L124 PetriNetUnfolderBase]: 4509/6885 cut-off events. [2024-06-03 19:05:27,084 INFO L125 PetriNetUnfolderBase]: For 476822/476912 co-relation queries the response was YES. [2024-06-03 19:05:27,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60153 conditions, 6885 events. 4509/6885 cut-off events. For 476822/476912 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 39347 event pairs, 1031 based on Foata normal form. 28/6867 useless extension candidates. Maximal degree in co-relation 60047. Up to 5327 conditions per place. [2024-06-03 19:05:27,184 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 399 selfloop transitions, 238 changer transitions 0/646 dead transitions. [2024-06-03 19:05:27,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 646 transitions, 10784 flow [2024-06-03 19:05:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:05:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:05:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2024-06-03 19:05:27,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2024-06-03 19:05:27,186 INFO L175 Difference]: Start difference. First operand has 229 places, 591 transitions, 8876 flow. Second operand 11 states and 228 transitions. [2024-06-03 19:05:27,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 646 transitions, 10784 flow [2024-06-03 19:05:27,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 646 transitions, 10746 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-03 19:05:27,983 INFO L231 Difference]: Finished difference. Result has 237 places, 597 transitions, 9447 flow [2024-06-03 19:05:27,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8838, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9447, PETRI_PLACES=237, PETRI_TRANSITIONS=597} [2024-06-03 19:05:27,985 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 192 predicate places. [2024-06-03 19:05:27,985 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 597 transitions, 9447 flow [2024-06-03 19:05:27,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:05:27,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:27,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:27,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 19:05:27,986 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:27,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1961008048, now seen corresponding path program 6 times [2024-06-03 19:05:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698810890] [2024-06-03 19:05:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:29,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698810890] [2024-06-03 19:05:29,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698810890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:29,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:29,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924311020] [2024-06-03 19:05:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:29,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:30,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:30,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 597 transitions, 9447 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:30,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:30,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:30,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:31,933 INFO L124 PetriNetUnfolderBase]: 4596/7002 cut-off events. [2024-06-03 19:05:31,933 INFO L125 PetriNetUnfolderBase]: For 499605/499708 co-relation queries the response was YES. [2024-06-03 19:05:31,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63022 conditions, 7002 events. 4596/7002 cut-off events. For 499605/499708 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 40049 event pairs, 1197 based on Foata normal form. 19/6969 useless extension candidates. Maximal degree in co-relation 62914. Up to 6276 conditions per place. [2024-06-03 19:05:32,016 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 507 selfloop transitions, 154 changer transitions 0/670 dead transitions. [2024-06-03 19:05:32,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 670 transitions, 11633 flow [2024-06-03 19:05:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:05:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:05:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-03 19:05:32,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-03 19:05:32,037 INFO L175 Difference]: Start difference. First operand has 237 places, 597 transitions, 9447 flow. Second operand 10 states and 198 transitions. [2024-06-03 19:05:32,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 670 transitions, 11633 flow [2024-06-03 19:05:32,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 670 transitions, 11084 flow, removed 40 selfloop flow, removed 9 redundant places. [2024-06-03 19:05:32,862 INFO L231 Difference]: Finished difference. Result has 238 places, 627 transitions, 9728 flow [2024-06-03 19:05:32,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8898, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9728, PETRI_PLACES=238, PETRI_TRANSITIONS=627} [2024-06-03 19:05:32,866 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 193 predicate places. [2024-06-03 19:05:32,867 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 627 transitions, 9728 flow [2024-06-03 19:05:32,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:32,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:32,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:32,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 19:05:32,867 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:32,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:32,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1964579248, now seen corresponding path program 7 times [2024-06-03 19:05:32,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:32,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647497670] [2024-06-03 19:05:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647497670] [2024-06-03 19:05:34,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647497670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:34,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:34,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:05:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048659443] [2024-06-03 19:05:34,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:34,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:05:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:05:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:05:34,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:34,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 627 transitions, 9728 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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) [2024-06-03 19:05:34,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:34,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:34,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:35,943 INFO L124 PetriNetUnfolderBase]: 4588/6994 cut-off events. [2024-06-03 19:05:35,943 INFO L125 PetriNetUnfolderBase]: For 506439/506536 co-relation queries the response was YES. [2024-06-03 19:05:35,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62510 conditions, 6994 events. 4588/6994 cut-off events. For 506439/506536 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 40059 event pairs, 1201 based on Foata normal form. 17/6957 useless extension candidates. Maximal degree in co-relation 62401. Up to 6268 conditions per place. [2024-06-03 19:05:36,022 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 497 selfloop transitions, 149 changer transitions 0/655 dead transitions. [2024-06-03 19:05:36,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 655 transitions, 11144 flow [2024-06-03 19:05:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:05:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:05:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-03 19:05:36,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-03 19:05:36,024 INFO L175 Difference]: Start difference. First operand has 238 places, 627 transitions, 9728 flow. Second operand 8 states and 160 transitions. [2024-06-03 19:05:36,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 655 transitions, 11144 flow [2024-06-03 19:05:36,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 655 transitions, 10641 flow, removed 144 selfloop flow, removed 7 redundant places. [2024-06-03 19:05:37,000 INFO L231 Difference]: Finished difference. Result has 239 places, 627 transitions, 9621 flow [2024-06-03 19:05:37,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9225, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9621, PETRI_PLACES=239, PETRI_TRANSITIONS=627} [2024-06-03 19:05:37,001 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 194 predicate places. [2024-06-03 19:05:37,001 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 627 transitions, 9621 flow [2024-06-03 19:05:37,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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) [2024-06-03 19:05:37,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:37,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:37,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 19:05:37,002 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:37,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1964579093, now seen corresponding path program 11 times [2024-06-03 19:05:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192176456] [2024-06-03 19:05:37,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:38,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:38,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192176456] [2024-06-03 19:05:38,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192176456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:38,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:38,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146445926] [2024-06-03 19:05:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:38,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:38,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:38,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 627 transitions, 9621 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:38,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:38,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:38,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:40,129 INFO L124 PetriNetUnfolderBase]: 4567/6980 cut-off events. [2024-06-03 19:05:40,129 INFO L125 PetriNetUnfolderBase]: For 520519/520605 co-relation queries the response was YES. [2024-06-03 19:05:40,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62218 conditions, 6980 events. 4567/6980 cut-off events. For 520519/520605 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 39984 event pairs, 1193 based on Foata normal form. 21/6962 useless extension candidates. Maximal degree in co-relation 62108. Up to 6288 conditions per place. [2024-06-03 19:05:40,214 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 563 selfloop transitions, 103 changer transitions 0/675 dead transitions. [2024-06-03 19:05:40,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 675 transitions, 11330 flow [2024-06-03 19:05:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:05:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:05:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-03 19:05:40,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 19:05:40,216 INFO L175 Difference]: Start difference. First operand has 239 places, 627 transitions, 9621 flow. Second operand 9 states and 176 transitions. [2024-06-03 19:05:40,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 675 transitions, 11330 flow [2024-06-03 19:05:41,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 675 transitions, 10949 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 19:05:41,036 INFO L231 Difference]: Finished difference. Result has 239 places, 638 transitions, 9700 flow [2024-06-03 19:05:41,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9240, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9700, PETRI_PLACES=239, PETRI_TRANSITIONS=638} [2024-06-03 19:05:41,037 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 194 predicate places. [2024-06-03 19:05:41,037 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 638 transitions, 9700 flow [2024-06-03 19:05:41,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:41,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:41,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:41,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 19:05:41,038 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:41,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1312669414, now seen corresponding path program 8 times [2024-06-03 19:05:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277120780] [2024-06-03 19:05:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:41,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277120780] [2024-06-03 19:05:42,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277120780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:42,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65546206] [2024-06-03 19:05:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:42,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:42,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:42,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:42,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 638 transitions, 9700 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:42,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:42,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:42,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:44,169 INFO L124 PetriNetUnfolderBase]: 4547/6939 cut-off events. [2024-06-03 19:05:44,170 INFO L125 PetriNetUnfolderBase]: For 449896/449949 co-relation queries the response was YES. [2024-06-03 19:05:44,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60815 conditions, 6939 events. 4547/6939 cut-off events. For 449896/449949 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 39428 event pairs, 1068 based on Foata normal form. 16/6933 useless extension candidates. Maximal degree in co-relation 60706. Up to 5882 conditions per place. [2024-06-03 19:05:44,257 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 405 selfloop transitions, 255 changer transitions 0/669 dead transitions. [2024-06-03 19:05:44,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 669 transitions, 11258 flow [2024-06-03 19:05:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:05:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:05:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-03 19:05:44,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630681818181818 [2024-06-03 19:05:44,259 INFO L175 Difference]: Start difference. First operand has 239 places, 638 transitions, 9700 flow. Second operand 8 states and 163 transitions. [2024-06-03 19:05:44,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 669 transitions, 11258 flow [2024-06-03 19:05:45,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 669 transitions, 10940 flow, removed 76 selfloop flow, removed 7 redundant places. [2024-06-03 19:05:45,105 INFO L231 Difference]: Finished difference. Result has 240 places, 641 transitions, 10024 flow [2024-06-03 19:05:45,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9382, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10024, PETRI_PLACES=240, PETRI_TRANSITIONS=641} [2024-06-03 19:05:45,106 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 195 predicate places. [2024-06-03 19:05:45,106 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 641 transitions, 10024 flow [2024-06-03 19:05:45,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:45,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:45,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:45,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 19:05:45,107 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:45,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1960860023, now seen corresponding path program 12 times [2024-06-03 19:05:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493959514] [2024-06-03 19:05:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:46,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493959514] [2024-06-03 19:05:46,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493959514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:46,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:46,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:46,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378738099] [2024-06-03 19:05:46,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:46,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:46,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:46,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:46,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:46,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:46,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 641 transitions, 10024 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:46,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:46,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:46,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:48,032 INFO L124 PetriNetUnfolderBase]: 4667/7120 cut-off events. [2024-06-03 19:05:48,032 INFO L125 PetriNetUnfolderBase]: For 504072/504139 co-relation queries the response was YES. [2024-06-03 19:05:48,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63920 conditions, 7120 events. 4667/7120 cut-off events. For 504072/504139 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 41031 event pairs, 1046 based on Foata normal form. 30/7106 useless extension candidates. Maximal degree in co-relation 63810. Up to 5183 conditions per place. [2024-06-03 19:05:48,138 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 373 selfloop transitions, 340 changer transitions 0/722 dead transitions. [2024-06-03 19:05:48,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 722 transitions, 12829 flow [2024-06-03 19:05:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:05:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:05:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-06-03 19:05:48,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823232323232323 [2024-06-03 19:05:48,140 INFO L175 Difference]: Start difference. First operand has 240 places, 641 transitions, 10024 flow. Second operand 9 states and 191 transitions. [2024-06-03 19:05:48,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 722 transitions, 12829 flow [2024-06-03 19:05:49,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 722 transitions, 12210 flow, removed 51 selfloop flow, removed 8 redundant places. [2024-06-03 19:05:49,126 INFO L231 Difference]: Finished difference. Result has 243 places, 672 transitions, 11066 flow [2024-06-03 19:05:49,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=9421, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=312, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11066, PETRI_PLACES=243, PETRI_TRANSITIONS=672} [2024-06-03 19:05:49,127 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 198 predicate places. [2024-06-03 19:05:49,127 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 672 transitions, 11066 flow [2024-06-03 19:05:49,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:49,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:49,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:49,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 19:05:49,128 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:49,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1960854443, now seen corresponding path program 13 times [2024-06-03 19:05:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:49,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67251176] [2024-06-03 19:05:49,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:49,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:50,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67251176] [2024-06-03 19:05:50,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67251176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:50,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:50,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572751126] [2024-06-03 19:05:50,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:50,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:50,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:50,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:50,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 672 transitions, 11066 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:50,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:50,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:50,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:52,053 INFO L124 PetriNetUnfolderBase]: 4742/7260 cut-off events. [2024-06-03 19:05:52,054 INFO L125 PetriNetUnfolderBase]: For 496462/496521 co-relation queries the response was YES. [2024-06-03 19:05:52,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66506 conditions, 7260 events. 4742/7260 cut-off events. For 496462/496521 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 42032 event pairs, 936 based on Foata normal form. 30/7260 useless extension candidates. Maximal degree in co-relation 66395. Up to 4351 conditions per place. [2024-06-03 19:05:52,170 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 226 selfloop transitions, 491 changer transitions 0/726 dead transitions. [2024-06-03 19:05:52,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 726 transitions, 13414 flow [2024-06-03 19:05:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:05:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:05:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-03 19:05:52,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48737373737373735 [2024-06-03 19:05:52,172 INFO L175 Difference]: Start difference. First operand has 243 places, 672 transitions, 11066 flow. Second operand 9 states and 193 transitions. [2024-06-03 19:05:52,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 726 transitions, 13414 flow [2024-06-03 19:05:53,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 726 transitions, 12858 flow, removed 185 selfloop flow, removed 5 redundant places. [2024-06-03 19:05:53,153 INFO L231 Difference]: Finished difference. Result has 247 places, 681 transitions, 11829 flow [2024-06-03 19:05:53,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=10518, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=485, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11829, PETRI_PLACES=247, PETRI_TRANSITIONS=681} [2024-06-03 19:05:53,154 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 202 predicate places. [2024-06-03 19:05:53,154 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 681 transitions, 11829 flow [2024-06-03 19:05:53,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:53,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:53,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:53,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 19:05:53,155 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:53,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:53,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1816969493, now seen corresponding path program 14 times [2024-06-03 19:05:53,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:53,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623794285] [2024-06-03 19:05:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:54,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623794285] [2024-06-03 19:05:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623794285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:54,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393235961] [2024-06-03 19:05:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:54,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:54,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:54,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:54,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 681 transitions, 11829 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:54,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:54,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:54,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:05:56,018 INFO L124 PetriNetUnfolderBase]: 4933/7527 cut-off events. [2024-06-03 19:05:56,018 INFO L125 PetriNetUnfolderBase]: For 535081/535143 co-relation queries the response was YES. [2024-06-03 19:05:56,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71381 conditions, 7527 events. 4933/7527 cut-off events. For 535081/535143 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 43754 event pairs, 1292 based on Foata normal form. 46/7532 useless extension candidates. Maximal degree in co-relation 71269. Up to 6242 conditions per place. [2024-06-03 19:05:56,135 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 545 selfloop transitions, 208 changer transitions 0/762 dead transitions. [2024-06-03 19:05:56,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 762 transitions, 14969 flow [2024-06-03 19:05:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:05:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:05:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-03 19:05:56,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671717171717172 [2024-06-03 19:05:56,136 INFO L175 Difference]: Start difference. First operand has 247 places, 681 transitions, 11829 flow. Second operand 9 states and 185 transitions. [2024-06-03 19:05:56,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 762 transitions, 14969 flow [2024-06-03 19:05:57,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 762 transitions, 14586 flow, removed 79 selfloop flow, removed 5 redundant places. [2024-06-03 19:05:57,121 INFO L231 Difference]: Finished difference. Result has 251 places, 709 transitions, 12968 flow [2024-06-03 19:05:57,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=11466, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12968, PETRI_PLACES=251, PETRI_TRANSITIONS=709} [2024-06-03 19:05:57,122 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 206 predicate places. [2024-06-03 19:05:57,122 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 709 transitions, 12968 flow [2024-06-03 19:05:57,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:57,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:05:57,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:05:57,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 19:05:57,122 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:05:57,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:05:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1168773149, now seen corresponding path program 15 times [2024-06-03 19:05:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:05:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005646584] [2024-06-03 19:05:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:05:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:05:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:05:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:05:58,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:05:58,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005646584] [2024-06-03 19:05:58,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005646584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:05:58,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:05:58,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:05:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289959837] [2024-06-03 19:05:58,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:05:58,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:05:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:05:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:05:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:05:58,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:05:58,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 709 transitions, 12968 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:05:58,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:05:58,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:05:58,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:00,358 INFO L124 PetriNetUnfolderBase]: 5086/7759 cut-off events. [2024-06-03 19:06:00,358 INFO L125 PetriNetUnfolderBase]: For 525708/525770 co-relation queries the response was YES. [2024-06-03 19:06:00,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73680 conditions, 7759 events. 5086/7759 cut-off events. For 525708/525770 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 45331 event pairs, 1235 based on Foata normal form. 46/7764 useless extension candidates. Maximal degree in co-relation 73567. Up to 6391 conditions per place. [2024-06-03 19:06:00,448 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 563 selfloop transitions, 211 changer transitions 0/783 dead transitions. [2024-06-03 19:06:00,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 783 transitions, 15740 flow [2024-06-03 19:06:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:06:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:06:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-06-03 19:06:00,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-03 19:06:00,450 INFO L175 Difference]: Start difference. First operand has 251 places, 709 transitions, 12968 flow. Second operand 9 states and 187 transitions. [2024-06-03 19:06:00,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 783 transitions, 15740 flow [2024-06-03 19:06:01,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 783 transitions, 14980 flow, removed 296 selfloop flow, removed 6 redundant places. [2024-06-03 19:06:01,138 INFO L231 Difference]: Finished difference. Result has 254 places, 723 transitions, 13210 flow [2024-06-03 19:06:01,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12344, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13210, PETRI_PLACES=254, PETRI_TRANSITIONS=723} [2024-06-03 19:06:01,139 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 209 predicate places. [2024-06-03 19:06:01,139 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 723 transitions, 13210 flow [2024-06-03 19:06:01,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:01,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:01,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:01,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 19:06:01,140 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:01,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1061758421, now seen corresponding path program 16 times [2024-06-03 19:06:01,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:01,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332070058] [2024-06-03 19:06:01,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332070058] [2024-06-03 19:06:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332070058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:02,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:06:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934234076] [2024-06-03 19:06:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:02,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:06:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:06:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:06:02,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:02,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 723 transitions, 13210 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:02,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:02,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:02,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:04,377 INFO L124 PetriNetUnfolderBase]: 4997/7626 cut-off events. [2024-06-03 19:06:04,377 INFO L125 PetriNetUnfolderBase]: For 491362/491424 co-relation queries the response was YES. [2024-06-03 19:06:04,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71084 conditions, 7626 events. 4997/7626 cut-off events. For 491362/491424 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 44508 event pairs, 1311 based on Foata normal form. 40/7625 useless extension candidates. Maximal degree in co-relation 70970. Up to 6852 conditions per place. [2024-06-03 19:06:04,484 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 637 selfloop transitions, 118 changer transitions 0/764 dead transitions. [2024-06-03 19:06:04,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 764 transitions, 15001 flow [2024-06-03 19:06:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:06:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:06:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-03 19:06:04,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-06-03 19:06:04,486 INFO L175 Difference]: Start difference. First operand has 254 places, 723 transitions, 13210 flow. Second operand 9 states and 177 transitions. [2024-06-03 19:06:04,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 764 transitions, 15001 flow [2024-06-03 19:06:05,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 764 transitions, 14498 flow, removed 90 selfloop flow, removed 7 redundant places. [2024-06-03 19:06:05,276 INFO L231 Difference]: Finished difference. Result has 256 places, 726 transitions, 13026 flow [2024-06-03 19:06:05,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12707, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13026, PETRI_PLACES=256, PETRI_TRANSITIONS=726} [2024-06-03 19:06:05,277 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 211 predicate places. [2024-06-03 19:06:05,277 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 726 transitions, 13026 flow [2024-06-03 19:06:05,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:05,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:05,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:05,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 19:06:05,278 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:05,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash 795656043, now seen corresponding path program 2 times [2024-06-03 19:06:05,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:05,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727015765] [2024-06-03 19:06:05,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:05,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727015765] [2024-06-03 19:06:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727015765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:06,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:06:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790882775] [2024-06-03 19:06:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:06,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:06:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:06:06,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:06:06,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:06,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 726 transitions, 13026 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2024-06-03 19:06:06,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:06,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:06,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:08,072 INFO L124 PetriNetUnfolderBase]: 5569/8398 cut-off events. [2024-06-03 19:06:08,073 INFO L125 PetriNetUnfolderBase]: For 529761/530237 co-relation queries the response was YES. [2024-06-03 19:06:08,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76910 conditions, 8398 events. 5569/8398 cut-off events. For 529761/530237 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 48517 event pairs, 1677 based on Foata normal form. 87/8345 useless extension candidates. Maximal degree in co-relation 76796. Up to 7691 conditions per place. [2024-06-03 19:06:08,177 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 567 selfloop transitions, 26 changer transitions 0/743 dead transitions. [2024-06-03 19:06:08,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 743 transitions, 14392 flow [2024-06-03 19:06:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:06:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:06:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-03 19:06:08,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-06-03 19:06:08,178 INFO L175 Difference]: Start difference. First operand has 256 places, 726 transitions, 13026 flow. Second operand 6 states and 117 transitions. [2024-06-03 19:06:08,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 743 transitions, 14392 flow [2024-06-03 19:06:09,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 743 transitions, 14004 flow, removed 89 selfloop flow, removed 7 redundant places. [2024-06-03 19:06:09,061 INFO L231 Difference]: Finished difference. Result has 255 places, 729 transitions, 12735 flow [2024-06-03 19:06:09,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12638, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12735, PETRI_PLACES=255, PETRI_TRANSITIONS=729} [2024-06-03 19:06:09,062 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 210 predicate places. [2024-06-03 19:06:09,062 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 729 transitions, 12735 flow [2024-06-03 19:06:09,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2024-06-03 19:06:09,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:09,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:09,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 19:06:09,062 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:09,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2038045087, now seen corresponding path program 2 times [2024-06-03 19:06:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299826342] [2024-06-03 19:06:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299826342] [2024-06-03 19:06:10,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299826342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:10,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:10,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:06:10,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278724975] [2024-06-03 19:06:10,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:10,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:06:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:06:10,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:06:10,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:10,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 729 transitions, 12735 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:06:10,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:10,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:10,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:12,436 INFO L124 PetriNetUnfolderBase]: 4990/7610 cut-off events. [2024-06-03 19:06:12,436 INFO L125 PetriNetUnfolderBase]: For 495371/495438 co-relation queries the response was YES. [2024-06-03 19:06:12,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70170 conditions, 7610 events. 4990/7610 cut-off events. For 495371/495438 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 44418 event pairs, 1049 based on Foata normal form. 28/7594 useless extension candidates. Maximal degree in co-relation 70055. Up to 5351 conditions per place. [2024-06-03 19:06:12,543 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 380 selfloop transitions, 397 changer transitions 0/787 dead transitions. [2024-06-03 19:06:12,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 787 transitions, 14836 flow [2024-06-03 19:06:12,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:06:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:06:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2024-06-03 19:06:12,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669421487603306 [2024-06-03 19:06:12,544 INFO L175 Difference]: Start difference. First operand has 255 places, 729 transitions, 12735 flow. Second operand 11 states and 226 transitions. [2024-06-03 19:06:12,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 787 transitions, 14836 flow [2024-06-03 19:06:13,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 787 transitions, 14771 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-03 19:06:13,530 INFO L231 Difference]: Finished difference. Result has 262 places, 729 transitions, 13490 flow [2024-06-03 19:06:13,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12672, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=397, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13490, PETRI_PLACES=262, PETRI_TRANSITIONS=729} [2024-06-03 19:06:13,531 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 217 predicate places. [2024-06-03 19:06:13,531 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 729 transitions, 13490 flow [2024-06-03 19:06:13,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:06:13,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:13,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:13,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 19:06:13,532 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:13,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash -309427465, now seen corresponding path program 17 times [2024-06-03 19:06:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:13,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629629713] [2024-06-03 19:06:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629629713] [2024-06-03 19:06:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629629713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:14,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:14,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:06:14,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193355792] [2024-06-03 19:06:14,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:14,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:06:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:14,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:06:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:06:14,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:14,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 729 transitions, 13490 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:14,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:14,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:14,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:16,488 INFO L124 PetriNetUnfolderBase]: 5087/7764 cut-off events. [2024-06-03 19:06:16,488 INFO L125 PetriNetUnfolderBase]: For 524836/524883 co-relation queries the response was YES. [2024-06-03 19:06:16,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73508 conditions, 7764 events. 5087/7764 cut-off events. For 524836/524883 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 45553 event pairs, 1573 based on Foata normal form. 20/7735 useless extension candidates. Maximal degree in co-relation 73393. Up to 7163 conditions per place. [2024-06-03 19:06:16,598 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 720 selfloop transitions, 51 changer transitions 0/781 dead transitions. [2024-06-03 19:06:16,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 781 transitions, 15852 flow [2024-06-03 19:06:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:06:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:06:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-03 19:06:16,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-06-03 19:06:16,599 INFO L175 Difference]: Start difference. First operand has 262 places, 729 transitions, 13490 flow. Second operand 9 states and 170 transitions. [2024-06-03 19:06:16,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 781 transitions, 15852 flow [2024-06-03 19:06:17,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 781 transitions, 15118 flow, removed 52 selfloop flow, removed 8 redundant places. [2024-06-03 19:06:17,643 INFO L231 Difference]: Finished difference. Result has 263 places, 743 transitions, 13456 flow [2024-06-03 19:06:17,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12767, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13456, PETRI_PLACES=263, PETRI_TRANSITIONS=743} [2024-06-03 19:06:17,644 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 218 predicate places. [2024-06-03 19:06:17,644 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 743 transitions, 13456 flow [2024-06-03 19:06:17,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:17,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:17,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:17,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 19:06:17,644 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:17,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1747919011, now seen corresponding path program 1 times [2024-06-03 19:06:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:17,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874131317] [2024-06-03 19:06:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874131317] [2024-06-03 19:06:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874131317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:06:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211315691] [2024-06-03 19:06:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:18,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:06:18,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:06:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:06:18,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:18,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 743 transitions, 13456 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-06-03 19:06:18,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:18,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:18,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:20,603 INFO L124 PetriNetUnfolderBase]: 5688/8582 cut-off events. [2024-06-03 19:06:20,604 INFO L125 PetriNetUnfolderBase]: For 578196/578666 co-relation queries the response was YES. [2024-06-03 19:06:20,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78557 conditions, 8582 events. 5688/8582 cut-off events. For 578196/578666 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 49747 event pairs, 1701 based on Foata normal form. 90/8533 useless extension candidates. Maximal degree in co-relation 78442. Up to 7856 conditions per place. [2024-06-03 19:06:20,702 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 588 selfloop transitions, 33 changer transitions 0/771 dead transitions. [2024-06-03 19:06:20,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 771 transitions, 14932 flow [2024-06-03 19:06:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 19:06:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 19:06:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-03 19:06:20,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2024-06-03 19:06:20,703 INFO L175 Difference]: Start difference. First operand has 263 places, 743 transitions, 13456 flow. Second operand 7 states and 137 transitions. [2024-06-03 19:06:20,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 771 transitions, 14932 flow [2024-06-03 19:06:21,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 771 transitions, 14525 flow, removed 168 selfloop flow, removed 6 redundant places. [2024-06-03 19:06:21,738 INFO L231 Difference]: Finished difference. Result has 265 places, 752 transitions, 13217 flow [2024-06-03 19:06:21,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13049, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13217, PETRI_PLACES=265, PETRI_TRANSITIONS=752} [2024-06-03 19:06:21,739 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 220 predicate places. [2024-06-03 19:06:21,739 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 752 transitions, 13217 flow [2024-06-03 19:06:21,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-06-03 19:06:21,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:21,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:21,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 19:06:21,740 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:21,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash -108925499, now seen corresponding path program 1 times [2024-06-03 19:06:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200795833] [2024-06-03 19:06:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200795833] [2024-06-03 19:06:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200795833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:22,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:06:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674115894] [2024-06-03 19:06:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:22,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:06:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:22,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:06:22,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:06:22,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-03 19:06:22,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 752 transitions, 13217 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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) [2024-06-03 19:06:22,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:22,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-03 19:06:22,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:25,007 INFO L124 PetriNetUnfolderBase]: 6160/9132 cut-off events. [2024-06-03 19:06:25,007 INFO L125 PetriNetUnfolderBase]: For 574777/574790 co-relation queries the response was YES. [2024-06-03 19:06:25,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83426 conditions, 9132 events. 6160/9132 cut-off events. For 574777/574790 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 51075 event pairs, 2072 based on Foata normal form. 2/9093 useless extension candidates. Maximal degree in co-relation 83309. Up to 8826 conditions per place. [2024-06-03 19:06:25,125 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 752 selfloop transitions, 30 changer transitions 0/790 dead transitions. [2024-06-03 19:06:25,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 790 transitions, 15219 flow [2024-06-03 19:06:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:06:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:06:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-03 19:06:25,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 19:06:25,126 INFO L175 Difference]: Start difference. First operand has 265 places, 752 transitions, 13217 flow. Second operand 8 states and 144 transitions. [2024-06-03 19:06:25,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 790 transitions, 15219 flow [2024-06-03 19:06:26,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 790 transitions, 15182 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-03 19:06:26,269 INFO L231 Difference]: Finished difference. Result has 271 places, 765 transitions, 13589 flow [2024-06-03 19:06:26,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13180, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13589, PETRI_PLACES=271, PETRI_TRANSITIONS=765} [2024-06-03 19:06:26,270 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 226 predicate places. [2024-06-03 19:06:26,270 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 765 transitions, 13589 flow [2024-06-03 19:06:26,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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) [2024-06-03 19:06:26,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:26,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:26,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 19:06:26,271 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:26,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1557191401, now seen corresponding path program 18 times [2024-06-03 19:06:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:26,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996401162] [2024-06-03 19:06:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996401162] [2024-06-03 19:06:27,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996401162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:27,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:27,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:06:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145108217] [2024-06-03 19:06:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:27,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:06:27,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:06:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:06:27,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:27,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 765 transitions, 13589 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:27,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:27,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:27,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:29,367 INFO L124 PetriNetUnfolderBase]: 5369/8193 cut-off events. [2024-06-03 19:06:29,368 INFO L125 PetriNetUnfolderBase]: For 596499/596533 co-relation queries the response was YES. [2024-06-03 19:06:29,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78571 conditions, 8193 events. 5369/8193 cut-off events. For 596499/596533 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 48574 event pairs, 1483 based on Foata normal form. 20/8174 useless extension candidates. Maximal degree in co-relation 78451. Up to 6964 conditions per place. [2024-06-03 19:06:29,479 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 693 selfloop transitions, 150 changer transitions 0/853 dead transitions. [2024-06-03 19:06:29,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 853 transitions, 17316 flow [2024-06-03 19:06:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:06:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:06:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-03 19:06:29,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2024-06-03 19:06:29,480 INFO L175 Difference]: Start difference. First operand has 271 places, 765 transitions, 13589 flow. Second operand 9 states and 182 transitions. [2024-06-03 19:06:29,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 853 transitions, 17316 flow [2024-06-03 19:06:30,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 853 transitions, 17223 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-03 19:06:30,540 INFO L231 Difference]: Finished difference. Result has 274 places, 793 transitions, 14947 flow [2024-06-03 19:06:30,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13496, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14947, PETRI_PLACES=274, PETRI_TRANSITIONS=793} [2024-06-03 19:06:30,541 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 229 predicate places. [2024-06-03 19:06:30,541 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 793 transitions, 14947 flow [2024-06-03 19:06:30,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:30,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:30,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:30,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 19:06:30,542 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:30,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -445013885, now seen corresponding path program 19 times [2024-06-03 19:06:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:30,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18430506] [2024-06-03 19:06:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18430506] [2024-06-03 19:06:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18430506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:31,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:06:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715974156] [2024-06-03 19:06:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:31,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:06:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:06:31,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:06:31,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:31,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 793 transitions, 14947 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:31,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:31,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:31,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:33,701 INFO L124 PetriNetUnfolderBase]: 5331/8140 cut-off events. [2024-06-03 19:06:33,701 INFO L125 PetriNetUnfolderBase]: For 601878/601912 co-relation queries the response was YES. [2024-06-03 19:06:33,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78111 conditions, 8140 events. 5331/8140 cut-off events. For 601878/601912 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 48270 event pairs, 1476 based on Foata normal form. 20/8121 useless extension candidates. Maximal degree in co-relation 77990. Up to 6941 conditions per place. [2024-06-03 19:06:33,812 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 674 selfloop transitions, 160 changer transitions 0/844 dead transitions. [2024-06-03 19:06:33,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 844 transitions, 17241 flow [2024-06-03 19:06:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:06:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:06:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-03 19:06:33,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2024-06-03 19:06:33,813 INFO L175 Difference]: Start difference. First operand has 274 places, 793 transitions, 14947 flow. Second operand 9 states and 178 transitions. [2024-06-03 19:06:33,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 844 transitions, 17241 flow [2024-06-03 19:06:35,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 844 transitions, 15734 flow, removed 365 selfloop flow, removed 8 redundant places. [2024-06-03 19:06:35,153 INFO L231 Difference]: Finished difference. Result has 275 places, 793 transitions, 13783 flow [2024-06-03 19:06:35,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13440, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13783, PETRI_PLACES=275, PETRI_TRANSITIONS=793} [2024-06-03 19:06:35,154 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 230 predicate places. [2024-06-03 19:06:35,154 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 793 transitions, 13783 flow [2024-06-03 19:06:35,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:35,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:35,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:35,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 19:06:35,155 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:35,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash -444806495, now seen corresponding path program 20 times [2024-06-03 19:06:35,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:35,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718101609] [2024-06-03 19:06:35,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:36,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718101609] [2024-06-03 19:06:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718101609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:36,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:36,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:06:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10359628] [2024-06-03 19:06:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:36,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:06:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:06:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:06:36,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:36,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 793 transitions, 13783 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:36,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:36,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:36,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:38,582 INFO L124 PetriNetUnfolderBase]: 5309/8115 cut-off events. [2024-06-03 19:06:38,583 INFO L125 PetriNetUnfolderBase]: For 582601/582635 co-relation queries the response was YES. [2024-06-03 19:06:38,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75331 conditions, 8115 events. 5309/8115 cut-off events. For 582601/582635 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 48199 event pairs, 1507 based on Foata normal form. 14/8090 useless extension candidates. Maximal degree in co-relation 75211. Up to 7475 conditions per place. [2024-06-03 19:06:38,681 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 752 selfloop transitions, 73 changer transitions 0/835 dead transitions. [2024-06-03 19:06:38,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 835 transitions, 15745 flow [2024-06-03 19:06:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:06:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:06:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-03 19:06:38,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-03 19:06:38,682 INFO L175 Difference]: Start difference. First operand has 275 places, 793 transitions, 13783 flow. Second operand 9 states and 172 transitions. [2024-06-03 19:06:38,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 835 transitions, 15745 flow [2024-06-03 19:06:39,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 835 transitions, 15129 flow, removed 176 selfloop flow, removed 7 redundant places. [2024-06-03 19:06:39,698 INFO L231 Difference]: Finished difference. Result has 277 places, 796 transitions, 13395 flow [2024-06-03 19:06:39,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13179, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13395, PETRI_PLACES=277, PETRI_TRANSITIONS=796} [2024-06-03 19:06:39,699 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 232 predicate places. [2024-06-03 19:06:39,699 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 796 transitions, 13395 flow [2024-06-03 19:06:39,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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) [2024-06-03 19:06:39,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:39,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:39,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 19:06:39,699 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:39,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash 808988523, now seen corresponding path program 3 times [2024-06-03 19:06:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980807745] [2024-06-03 19:06:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:40,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:40,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980807745] [2024-06-03 19:06:40,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980807745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:40,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:06:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354247206] [2024-06-03 19:06:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:40,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:06:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:40,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:06:40,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:06:40,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:40,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 796 transitions, 13395 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2024-06-03 19:06:40,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:40,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:40,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:42,590 INFO L124 PetriNetUnfolderBase]: 5939/8961 cut-off events. [2024-06-03 19:06:42,591 INFO L125 PetriNetUnfolderBase]: For 636915/637456 co-relation queries the response was YES. [2024-06-03 19:06:42,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80261 conditions, 8961 events. 5939/8961 cut-off events. For 636915/637456 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 52654 event pairs, 1937 based on Foata normal form. 122/8913 useless extension candidates. Maximal degree in co-relation 80140. Up to 8281 conditions per place. [2024-06-03 19:06:42,705 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 642 selfloop transitions, 12 changer transitions 0/804 dead transitions. [2024-06-03 19:06:42,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 804 transitions, 14733 flow [2024-06-03 19:06:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:06:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:06:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 19:06:42,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 19:06:42,706 INFO L175 Difference]: Start difference. First operand has 277 places, 796 transitions, 13395 flow. Second operand 6 states and 108 transitions. [2024-06-03 19:06:42,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 804 transitions, 14733 flow [2024-06-03 19:06:44,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 804 transitions, 14278 flow, removed 56 selfloop flow, removed 8 redundant places. [2024-06-03 19:06:44,017 INFO L231 Difference]: Finished difference. Result has 275 places, 796 transitions, 12970 flow [2024-06-03 19:06:44,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12940, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12970, PETRI_PLACES=275, PETRI_TRANSITIONS=796} [2024-06-03 19:06:44,018 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 230 predicate places. [2024-06-03 19:06:44,018 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 796 transitions, 12970 flow [2024-06-03 19:06:44,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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) [2024-06-03 19:06:44,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:44,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:44,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 19:06:44,018 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:44,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash -360252439, now seen corresponding path program 1 times [2024-06-03 19:06:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172502048] [2024-06-03 19:06:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:44,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:44,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172502048] [2024-06-03 19:06:44,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172502048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:44,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:44,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:06:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19984329] [2024-06-03 19:06:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:44,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:06:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:44,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:06:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:06:44,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2024-06-03 19:06:44,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 796 transitions, 12970 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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) [2024-06-03 19:06:44,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:44,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2024-06-03 19:06:44,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:47,004 INFO L124 PetriNetUnfolderBase]: 6530/9627 cut-off events. [2024-06-03 19:06:47,005 INFO L125 PetriNetUnfolderBase]: For 607752/607752 co-relation queries the response was YES. [2024-06-03 19:06:47,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84323 conditions, 9627 events. 6530/9627 cut-off events. For 607752/607752 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 53351 event pairs, 2226 based on Foata normal form. 1/9627 useless extension candidates. Maximal degree in co-relation 84201. Up to 9467 conditions per place. [2024-06-03 19:06:47,139 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 794 selfloop transitions, 17 changer transitions 0/814 dead transitions. [2024-06-03 19:06:47,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 814 transitions, 14836 flow [2024-06-03 19:06:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:06:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:06:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-03 19:06:47,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 19:06:47,141 INFO L175 Difference]: Start difference. First operand has 275 places, 796 transitions, 12970 flow. Second operand 6 states and 104 transitions. [2024-06-03 19:06:47,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 814 transitions, 14836 flow [2024-06-03 19:06:48,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 814 transitions, 14793 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 19:06:48,195 INFO L231 Difference]: Finished difference. Result has 276 places, 802 transitions, 13061 flow [2024-06-03 19:06:48,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12927, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13061, PETRI_PLACES=276, PETRI_TRANSITIONS=802} [2024-06-03 19:06:48,196 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 231 predicate places. [2024-06-03 19:06:48,196 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 802 transitions, 13061 flow [2024-06-03 19:06:48,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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) [2024-06-03 19:06:48,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:48,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:48,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 19:06:48,196 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:48,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2112308819, now seen corresponding path program 2 times [2024-06-03 19:06:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470065434] [2024-06-03 19:06:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470065434] [2024-06-03 19:06:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470065434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:48,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:48,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 19:06:48,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000809963] [2024-06-03 19:06:48,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:48,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 19:06:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 19:06:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 19:06:48,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2024-06-03 19:06:48,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 802 transitions, 13061 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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) [2024-06-03 19:06:48,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:48,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2024-06-03 19:06:48,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:51,041 INFO L124 PetriNetUnfolderBase]: 6527/9624 cut-off events. [2024-06-03 19:06:51,042 INFO L125 PetriNetUnfolderBase]: For 625905/625907 co-relation queries the response was YES. [2024-06-03 19:06:51,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84968 conditions, 9624 events. 6527/9624 cut-off events. For 625905/625907 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 53362 event pairs, 2229 based on Foata normal form. 3/9626 useless extension candidates. Maximal degree in co-relation 84845. Up to 9464 conditions per place. [2024-06-03 19:06:51,169 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 790 selfloop transitions, 17 changer transitions 0/810 dead transitions. [2024-06-03 19:06:51,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 810 transitions, 14705 flow [2024-06-03 19:06:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 19:06:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 19:06:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-03 19:06:51,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-03 19:06:51,174 INFO L175 Difference]: Start difference. First operand has 276 places, 802 transitions, 13061 flow. Second operand 6 states and 100 transitions. [2024-06-03 19:06:51,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 810 transitions, 14705 flow [2024-06-03 19:06:52,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 810 transitions, 14630 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-03 19:06:52,379 INFO L231 Difference]: Finished difference. Result has 280 places, 802 transitions, 13026 flow [2024-06-03 19:06:52,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12986, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13026, PETRI_PLACES=280, PETRI_TRANSITIONS=802} [2024-06-03 19:06:52,380 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 235 predicate places. [2024-06-03 19:06:52,380 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 802 transitions, 13026 flow [2024-06-03 19:06:52,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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) [2024-06-03 19:06:52,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:52,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:52,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 19:06:52,381 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:52,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1960489543, now seen corresponding path program 1 times [2024-06-03 19:06:52,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743205025] [2024-06-03 19:06:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:53,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:53,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743205025] [2024-06-03 19:06:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743205025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:06:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419410211] [2024-06-03 19:06:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:53,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:06:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:06:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:06:53,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:53,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 802 transitions, 13026 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:06:53,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:53,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:53,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:06:55,629 INFO L124 PetriNetUnfolderBase]: 5440/8281 cut-off events. [2024-06-03 19:06:55,630 INFO L125 PetriNetUnfolderBase]: For 669341/669396 co-relation queries the response was YES. [2024-06-03 19:06:55,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78097 conditions, 8281 events. 5440/8281 cut-off events. For 669341/669396 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 49074 event pairs, 1022 based on Foata normal form. 18/8246 useless extension candidates. Maximal degree in co-relation 77972. Up to 7287 conditions per place. [2024-06-03 19:06:55,745 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 685 selfloop transitions, 160 changer transitions 0/857 dead transitions. [2024-06-03 19:06:55,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 857 transitions, 15480 flow [2024-06-03 19:06:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:06:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:06:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-03 19:06:55,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44834710743801653 [2024-06-03 19:06:55,747 INFO L175 Difference]: Start difference. First operand has 280 places, 802 transitions, 13026 flow. Second operand 11 states and 217 transitions. [2024-06-03 19:06:55,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 857 transitions, 15480 flow [2024-06-03 19:06:56,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 857 transitions, 15432 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 19:06:57,011 INFO L231 Difference]: Finished difference. Result has 288 places, 811 transitions, 13611 flow [2024-06-03 19:06:57,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=12978, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13611, PETRI_PLACES=288, PETRI_TRANSITIONS=811} [2024-06-03 19:06:57,012 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 243 predicate places. [2024-06-03 19:06:57,013 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 811 transitions, 13611 flow [2024-06-03 19:06:57,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:06:57,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:06:57,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:06:57,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 19:06:57,013 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:06:57,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:06:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1678300415, now seen corresponding path program 2 times [2024-06-03 19:06:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:06:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302168558] [2024-06-03 19:06:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:06:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:06:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:06:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:06:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:06:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302168558] [2024-06-03 19:06:58,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302168558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:06:58,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:06:58,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:06:58,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801211788] [2024-06-03 19:06:58,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:06:58,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:06:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:06:58,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:06:58,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:06:58,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:06:58,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 811 transitions, 13611 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:06:58,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:06:58,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:06:58,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:00,368 INFO L124 PetriNetUnfolderBase]: 5507/8410 cut-off events. [2024-06-03 19:07:00,369 INFO L125 PetriNetUnfolderBase]: For 695244/695295 co-relation queries the response was YES. [2024-06-03 19:07:00,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80489 conditions, 8410 events. 5507/8410 cut-off events. For 695244/695295 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 50207 event pairs, 1195 based on Foata normal form. 20/8387 useless extension candidates. Maximal degree in co-relation 80361. Up to 7462 conditions per place. [2024-06-03 19:07:00,486 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 693 selfloop transitions, 170 changer transitions 0/875 dead transitions. [2024-06-03 19:07:00,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 875 transitions, 16246 flow [2024-06-03 19:07:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 19:07:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 19:07:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2024-06-03 19:07:00,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44507575757575757 [2024-06-03 19:07:00,487 INFO L175 Difference]: Start difference. First operand has 288 places, 811 transitions, 13611 flow. Second operand 12 states and 235 transitions. [2024-06-03 19:07:00,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 875 transitions, 16246 flow [2024-06-03 19:07:01,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 875 transitions, 15672 flow, removed 197 selfloop flow, removed 7 redundant places. [2024-06-03 19:07:01,981 INFO L231 Difference]: Finished difference. Result has 294 places, 825 transitions, 13910 flow [2024-06-03 19:07:01,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13269, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13910, PETRI_PLACES=294, PETRI_TRANSITIONS=825} [2024-06-03 19:07:01,982 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 249 predicate places. [2024-06-03 19:07:01,982 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 825 transitions, 13910 flow [2024-06-03 19:07:01,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:01,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:01,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:01,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 19:07:01,982 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:01,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1689085625, now seen corresponding path program 3 times [2024-06-03 19:07:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610196588] [2024-06-03 19:07:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:01,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610196588] [2024-06-03 19:07:02,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610196588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:02,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:02,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:07:02,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331059764] [2024-06-03 19:07:02,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:02,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:07:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:07:02,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:07:03,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:03,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 825 transitions, 13910 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:03,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:03,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:05,445 INFO L124 PetriNetUnfolderBase]: 5510/8419 cut-off events. [2024-06-03 19:07:05,445 INFO L125 PetriNetUnfolderBase]: For 700897/700948 co-relation queries the response was YES. [2024-06-03 19:07:05,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80208 conditions, 8419 events. 5510/8419 cut-off events. For 700897/700948 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 50368 event pairs, 1217 based on Foata normal form. 20/8396 useless extension candidates. Maximal degree in co-relation 80078. Up to 7572 conditions per place. [2024-06-03 19:07:05,576 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 700 selfloop transitions, 160 changer transitions 0/872 dead transitions. [2024-06-03 19:07:05,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 872 transitions, 15902 flow [2024-06-03 19:07:05,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 19:07:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 19:07:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-06-03 19:07:05,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-06-03 19:07:05,577 INFO L175 Difference]: Start difference. First operand has 294 places, 825 transitions, 13910 flow. Second operand 12 states and 230 transitions. [2024-06-03 19:07:05,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 872 transitions, 15902 flow [2024-06-03 19:07:07,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 872 transitions, 15634 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-03 19:07:07,433 INFO L231 Difference]: Finished difference. Result has 299 places, 827 transitions, 14048 flow [2024-06-03 19:07:07,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13652, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14048, PETRI_PLACES=299, PETRI_TRANSITIONS=827} [2024-06-03 19:07:07,434 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 254 predicate places. [2024-06-03 19:07:07,435 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 827 transitions, 14048 flow [2024-06-03 19:07:07,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:07,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:07,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 19:07:07,435 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:07,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2115839557, now seen corresponding path program 4 times [2024-06-03 19:07:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:07,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19017165] [2024-06-03 19:07:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:07,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19017165] [2024-06-03 19:07:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19017165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:08,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:07:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177817414] [2024-06-03 19:07:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:08,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:07:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:07:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:07:09,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:09,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 827 transitions, 14048 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:07:09,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:09,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:09,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:11,454 INFO L124 PetriNetUnfolderBase]: 5671/8674 cut-off events. [2024-06-03 19:07:11,454 INFO L125 PetriNetUnfolderBase]: For 729304/729353 co-relation queries the response was YES. [2024-06-03 19:07:11,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82278 conditions, 8674 events. 5671/8674 cut-off events. For 729304/729353 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 52166 event pairs, 1280 based on Foata normal form. 22/8661 useless extension candidates. Maximal degree in co-relation 82146. Up to 7843 conditions per place. [2024-06-03 19:07:11,607 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 776 selfloop transitions, 112 changer transitions 0/900 dead transitions. [2024-06-03 19:07:11,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 900 transitions, 16700 flow [2024-06-03 19:07:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 19:07:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 19:07:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-03 19:07:11,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412878787878788 [2024-06-03 19:07:11,609 INFO L175 Difference]: Start difference. First operand has 299 places, 827 transitions, 14048 flow. Second operand 12 states and 233 transitions. [2024-06-03 19:07:11,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 900 transitions, 16700 flow [2024-06-03 19:07:13,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 900 transitions, 16256 flow, removed 63 selfloop flow, removed 10 redundant places. [2024-06-03 19:07:13,287 INFO L231 Difference]: Finished difference. Result has 303 places, 851 transitions, 14387 flow [2024-06-03 19:07:13,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=13654, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14387, PETRI_PLACES=303, PETRI_TRANSITIONS=851} [2024-06-03 19:07:13,288 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 258 predicate places. [2024-06-03 19:07:13,288 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 851 transitions, 14387 flow [2024-06-03 19:07:13,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:07:13,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:13,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:13,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 19:07:13,289 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:13,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash -652793495, now seen corresponding path program 5 times [2024-06-03 19:07:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29323881] [2024-06-03 19:07:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29323881] [2024-06-03 19:07:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29323881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:14,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:14,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:07:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209278567] [2024-06-03 19:07:14,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:14,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:07:14,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:14,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:07:14,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:07:14,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:14,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 851 transitions, 14387 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:14,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:14,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:14,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:17,107 INFO L124 PetriNetUnfolderBase]: 5680/8685 cut-off events. [2024-06-03 19:07:17,108 INFO L125 PetriNetUnfolderBase]: For 755989/756042 co-relation queries the response was YES. [2024-06-03 19:07:17,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82460 conditions, 8685 events. 5680/8685 cut-off events. For 755989/756042 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 52357 event pairs, 1287 based on Foata normal form. 22/8668 useless extension candidates. Maximal degree in co-relation 82325. Up to 7922 conditions per place. [2024-06-03 19:07:17,218 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 763 selfloop transitions, 111 changer transitions 0/886 dead transitions. [2024-06-03 19:07:17,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 886 transitions, 16271 flow [2024-06-03 19:07:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:07:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:07:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-03 19:07:17,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-06-03 19:07:17,220 INFO L175 Difference]: Start difference. First operand has 303 places, 851 transitions, 14387 flow. Second operand 10 states and 197 transitions. [2024-06-03 19:07:17,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 886 transitions, 16271 flow [2024-06-03 19:07:18,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 886 transitions, 16038 flow, removed 102 selfloop flow, removed 4 redundant places. [2024-06-03 19:07:18,933 INFO L231 Difference]: Finished difference. Result has 309 places, 851 transitions, 14396 flow [2024-06-03 19:07:18,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14154, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14396, PETRI_PLACES=309, PETRI_TRANSITIONS=851} [2024-06-03 19:07:18,934 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 264 predicate places. [2024-06-03 19:07:18,934 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 851 transitions, 14396 flow [2024-06-03 19:07:18,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:18,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:18,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:18,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 19:07:18,934 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:18,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1539345953, now seen corresponding path program 6 times [2024-06-03 19:07:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:18,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882200819] [2024-06-03 19:07:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:18,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882200819] [2024-06-03 19:07:20,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882200819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:20,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:20,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:07:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739131341] [2024-06-03 19:07:20,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:20,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:07:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:20,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:07:20,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:07:20,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:20,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 851 transitions, 14396 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:07:20,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:20,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:20,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:23,406 INFO L124 PetriNetUnfolderBase]: 5670/8659 cut-off events. [2024-06-03 19:07:23,407 INFO L125 PetriNetUnfolderBase]: For 754190/754239 co-relation queries the response was YES. [2024-06-03 19:07:23,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82418 conditions, 8659 events. 5670/8659 cut-off events. For 754190/754239 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 51846 event pairs, 1140 based on Foata normal form. 22/8654 useless extension candidates. Maximal degree in co-relation 82281. Up to 7769 conditions per place. [2024-06-03 19:07:23,544 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 718 selfloop transitions, 164 changer transitions 0/894 dead transitions. [2024-06-03 19:07:23,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 894 transitions, 16433 flow [2024-06-03 19:07:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:07:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:07:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2024-06-03 19:07:23,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44214876033057854 [2024-06-03 19:07:23,551 INFO L175 Difference]: Start difference. First operand has 309 places, 851 transitions, 14396 flow. Second operand 11 states and 214 transitions. [2024-06-03 19:07:23,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 894 transitions, 16433 flow [2024-06-03 19:07:25,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 894 transitions, 16246 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 19:07:25,148 INFO L231 Difference]: Finished difference. Result has 313 places, 853 transitions, 14633 flow [2024-06-03 19:07:25,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14209, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14633, PETRI_PLACES=313, PETRI_TRANSITIONS=853} [2024-06-03 19:07:25,149 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 268 predicate places. [2024-06-03 19:07:25,149 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 853 transitions, 14633 flow [2024-06-03 19:07:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:07:25,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:25,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:25,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 19:07:25,150 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:25,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1066227485, now seen corresponding path program 1 times [2024-06-03 19:07:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382049410] [2024-06-03 19:07:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:26,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382049410] [2024-06-03 19:07:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382049410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:26,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:07:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896256948] [2024-06-03 19:07:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:26,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:07:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:26,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:07:26,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:07:26,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:26,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 853 transitions, 14633 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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) [2024-06-03 19:07:26,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:26,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:26,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:28,451 INFO L124 PetriNetUnfolderBase]: 6220/9458 cut-off events. [2024-06-03 19:07:28,451 INFO L125 PetriNetUnfolderBase]: For 825843/826221 co-relation queries the response was YES. [2024-06-03 19:07:28,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86943 conditions, 9458 events. 6220/9458 cut-off events. For 825843/826221 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 56538 event pairs, 1747 based on Foata normal form. 168/9496 useless extension candidates. Maximal degree in co-relation 86805. Up to 8432 conditions per place. [2024-06-03 19:07:28,615 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 640 selfloop transitions, 75 changer transitions 0/885 dead transitions. [2024-06-03 19:07:28,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 885 transitions, 16399 flow [2024-06-03 19:07:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:07:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:07:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-03 19:07:28,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45170454545454547 [2024-06-03 19:07:28,616 INFO L175 Difference]: Start difference. First operand has 313 places, 853 transitions, 14633 flow. Second operand 8 states and 159 transitions. [2024-06-03 19:07:28,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 885 transitions, 16399 flow [2024-06-03 19:07:30,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 885 transitions, 15995 flow, removed 40 selfloop flow, removed 9 redundant places. [2024-06-03 19:07:30,362 INFO L231 Difference]: Finished difference. Result has 312 places, 859 transitions, 14495 flow [2024-06-03 19:07:30,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14229, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=781, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14495, PETRI_PLACES=312, PETRI_TRANSITIONS=859} [2024-06-03 19:07:30,363 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 267 predicate places. [2024-06-03 19:07:30,363 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 859 transitions, 14495 flow [2024-06-03 19:07:30,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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) [2024-06-03 19:07:30,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:30,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:30,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 19:07:30,364 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:30,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1018799585, now seen corresponding path program 7 times [2024-06-03 19:07:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89622394] [2024-06-03 19:07:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:30,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:31,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:31,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89622394] [2024-06-03 19:07:31,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89622394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:31,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:07:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679861993] [2024-06-03 19:07:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:31,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:07:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:31,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:07:31,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:07:31,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:31,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 859 transitions, 14495 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:07:31,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:31,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:31,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:34,360 INFO L124 PetriNetUnfolderBase]: 5896/9029 cut-off events. [2024-06-03 19:07:34,361 INFO L125 PetriNetUnfolderBase]: For 824828/824891 co-relation queries the response was YES. [2024-06-03 19:07:34,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86349 conditions, 9029 events. 5896/9029 cut-off events. For 824828/824891 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 54879 event pairs, 1383 based on Foata normal form. 18/9008 useless extension candidates. Maximal degree in co-relation 86210. Up to 8208 conditions per place. [2024-06-03 19:07:34,496 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 824 selfloop transitions, 101 changer transitions 0/939 dead transitions. [2024-06-03 19:07:34,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 939 transitions, 17401 flow [2024-06-03 19:07:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:07:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:07:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-03 19:07:34,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2024-06-03 19:07:34,498 INFO L175 Difference]: Start difference. First operand has 312 places, 859 transitions, 14495 flow. Second operand 11 states and 212 transitions. [2024-06-03 19:07:34,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 939 transitions, 17401 flow [2024-06-03 19:07:36,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 939 transitions, 17288 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-03 19:07:36,101 INFO L231 Difference]: Finished difference. Result has 320 places, 887 transitions, 15186 flow [2024-06-03 19:07:36,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14385, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15186, PETRI_PLACES=320, PETRI_TRANSITIONS=887} [2024-06-03 19:07:36,102 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 275 predicate places. [2024-06-03 19:07:36,102 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 887 transitions, 15186 flow [2024-06-03 19:07:36,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:07:36,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:36,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:36,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 19:07:36,103 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:36,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:36,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1018860035, now seen corresponding path program 8 times [2024-06-03 19:07:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:36,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526806478] [2024-06-03 19:07:36,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:36,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:37,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526806478] [2024-06-03 19:07:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526806478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:37,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:37,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:07:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399730749] [2024-06-03 19:07:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:37,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:07:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:37,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:07:37,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:07:37,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:37,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 887 transitions, 15186 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:07:37,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:37,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:37,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:40,574 INFO L124 PetriNetUnfolderBase]: 5956/9132 cut-off events. [2024-06-03 19:07:40,575 INFO L125 PetriNetUnfolderBase]: For 857549/857612 co-relation queries the response was YES. [2024-06-03 19:07:40,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88244 conditions, 9132 events. 5956/9132 cut-off events. For 857549/857612 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 55733 event pairs, 1430 based on Foata normal form. 20/9114 useless extension candidates. Maximal degree in co-relation 88102. Up to 8446 conditions per place. [2024-06-03 19:07:40,704 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 848 selfloop transitions, 90 changer transitions 0/952 dead transitions. [2024-06-03 19:07:40,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 952 transitions, 17657 flow [2024-06-03 19:07:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 19:07:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 19:07:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 241 transitions. [2024-06-03 19:07:40,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42132867132867136 [2024-06-03 19:07:40,706 INFO L175 Difference]: Start difference. First operand has 320 places, 887 transitions, 15186 flow. Second operand 13 states and 241 transitions. [2024-06-03 19:07:40,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 952 transitions, 17657 flow [2024-06-03 19:07:42,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 952 transitions, 17502 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-03 19:07:42,371 INFO L231 Difference]: Finished difference. Result has 330 places, 904 transitions, 15659 flow [2024-06-03 19:07:42,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15031, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15659, PETRI_PLACES=330, PETRI_TRANSITIONS=904} [2024-06-03 19:07:42,371 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 285 predicate places. [2024-06-03 19:07:42,372 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 904 transitions, 15659 flow [2024-06-03 19:07:42,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:07:42,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:42,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:42,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 19:07:42,372 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:42,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash 217397577, now seen corresponding path program 9 times [2024-06-03 19:07:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547680252] [2024-06-03 19:07:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547680252] [2024-06-03 19:07:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547680252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:43,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:43,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:07:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571853915] [2024-06-03 19:07:43,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:43,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:07:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:43,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:07:43,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:07:43,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:43,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 904 transitions, 15659 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:43,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:43,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:43,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:46,414 INFO L124 PetriNetUnfolderBase]: 5938/9100 cut-off events. [2024-06-03 19:07:46,414 INFO L125 PetriNetUnfolderBase]: For 865196/865259 co-relation queries the response was YES. [2024-06-03 19:07:46,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88104 conditions, 9100 events. 5938/9100 cut-off events. For 865196/865259 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 55401 event pairs, 1420 based on Foata normal form. 20/9082 useless extension candidates. Maximal degree in co-relation 87958. Up to 8365 conditions per place. [2024-06-03 19:07:46,575 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 834 selfloop transitions, 93 changer transitions 0/941 dead transitions. [2024-06-03 19:07:46,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 941 transitions, 17701 flow [2024-06-03 19:07:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:07:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:07:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-03 19:07:46,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340909090909091 [2024-06-03 19:07:46,577 INFO L175 Difference]: Start difference. First operand has 330 places, 904 transitions, 15659 flow. Second operand 10 states and 191 transitions. [2024-06-03 19:07:46,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 941 transitions, 17701 flow [2024-06-03 19:07:48,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 941 transitions, 17267 flow, removed 123 selfloop flow, removed 11 redundant places. [2024-06-03 19:07:48,735 INFO L231 Difference]: Finished difference. Result has 329 places, 904 transitions, 15443 flow [2024-06-03 19:07:48,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15225, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15443, PETRI_PLACES=329, PETRI_TRANSITIONS=904} [2024-06-03 19:07:48,738 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 284 predicate places. [2024-06-03 19:07:48,738 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 904 transitions, 15443 flow [2024-06-03 19:07:48,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:48,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:48,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:48,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 19:07:48,740 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:48,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1136947715, now seen corresponding path program 10 times [2024-06-03 19:07:48,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:48,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294055595] [2024-06-03 19:07:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:48,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294055595] [2024-06-03 19:07:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294055595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 19:07:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822709762] [2024-06-03 19:07:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:50,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 19:07:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:50,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 19:07:50,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 19:07:50,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:07:50,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 904 transitions, 15443 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:50,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:50,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:07:50,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:52,686 INFO L124 PetriNetUnfolderBase]: 5965/9162 cut-off events. [2024-06-03 19:07:52,686 INFO L125 PetriNetUnfolderBase]: For 879844/879911 co-relation queries the response was YES. [2024-06-03 19:07:52,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88451 conditions, 9162 events. 5965/9162 cut-off events. For 879844/879911 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 56216 event pairs, 1355 based on Foata normal form. 18/9137 useless extension candidates. Maximal degree in co-relation 88304. Up to 8311 conditions per place. [2024-06-03 19:07:52,834 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 799 selfloop transitions, 142 changer transitions 0/955 dead transitions. [2024-06-03 19:07:52,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 955 transitions, 17756 flow [2024-06-03 19:07:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:07:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:07:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-03 19:07:52,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44772727272727275 [2024-06-03 19:07:52,836 INFO L175 Difference]: Start difference. First operand has 329 places, 904 transitions, 15443 flow. Second operand 10 states and 197 transitions. [2024-06-03 19:07:52,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 955 transitions, 17756 flow [2024-06-03 19:07:55,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 955 transitions, 17588 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 19:07:55,156 INFO L231 Difference]: Finished difference. Result has 331 places, 908 transitions, 15673 flow [2024-06-03 19:07:55,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15275, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15673, PETRI_PLACES=331, PETRI_TRANSITIONS=908} [2024-06-03 19:07:55,157 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 286 predicate places. [2024-06-03 19:07:55,157 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 908 transitions, 15673 flow [2024-06-03 19:07:55,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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) [2024-06-03 19:07:55,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:07:55,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:07:55,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 19:07:55,158 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:07:55,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:07:55,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1263479235, now seen corresponding path program 1 times [2024-06-03 19:07:55,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:07:55,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904284008] [2024-06-03 19:07:55,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:07:55,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:07:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:07:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:07:56,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:07:56,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904284008] [2024-06-03 19:07:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904284008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:07:56,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:07:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:07:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489727933] [2024-06-03 19:07:56,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:07:56,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:07:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:07:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:07:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:07:56,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-03 19:07:56,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 908 transitions, 15673 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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) [2024-06-03 19:07:56,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:07:56,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-03 19:07:56,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:07:59,624 INFO L124 PetriNetUnfolderBase]: 7061/10539 cut-off events. [2024-06-03 19:07:59,624 INFO L125 PetriNetUnfolderBase]: For 932881/932918 co-relation queries the response was YES. [2024-06-03 19:07:59,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99253 conditions, 10539 events. 7061/10539 cut-off events. For 932881/932918 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 61488 event pairs, 1730 based on Foata normal form. 6/10501 useless extension candidates. Maximal degree in co-relation 99105. Up to 9947 conditions per place. [2024-06-03 19:07:59,788 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 845 selfloop transitions, 107 changer transitions 0/964 dead transitions. [2024-06-03 19:07:59,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 964 transitions, 18114 flow [2024-06-03 19:07:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 19:07:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 19:07:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-03 19:07:59,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-03 19:07:59,789 INFO L175 Difference]: Start difference. First operand has 331 places, 908 transitions, 15673 flow. Second operand 10 states and 190 transitions. [2024-06-03 19:07:59,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 964 transitions, 18114 flow [2024-06-03 19:08:01,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 964 transitions, 17824 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-03 19:08:01,905 INFO L231 Difference]: Finished difference. Result has 337 places, 928 transitions, 16031 flow [2024-06-03 19:08:01,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15383, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16031, PETRI_PLACES=337, PETRI_TRANSITIONS=928} [2024-06-03 19:08:01,906 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 292 predicate places. [2024-06-03 19:08:01,906 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 928 transitions, 16031 flow [2024-06-03 19:08:01,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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) [2024-06-03 19:08:01,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:08:01,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:08:01,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 19:08:01,906 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:08:01,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:08:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1302586849, now seen corresponding path program 11 times [2024-06-03 19:08:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:08:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307997008] [2024-06-03 19:08:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:08:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:08:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:08:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:08:03,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:08:03,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307997008] [2024-06-03 19:08:03,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307997008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:08:03,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:08:03,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:08:03,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662972356] [2024-06-03 19:08:03,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:08:03,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:08:03,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:08:03,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:08:03,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:08:03,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:08:03,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 928 transitions, 16031 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:08:03,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:08:03,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:08:03,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:08:06,268 INFO L124 PetriNetUnfolderBase]: 6033/9255 cut-off events. [2024-06-03 19:08:06,268 INFO L125 PetriNetUnfolderBase]: For 909798/909875 co-relation queries the response was YES. [2024-06-03 19:08:06,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90641 conditions, 9255 events. 6033/9255 cut-off events. For 909798/909875 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 56640 event pairs, 1432 based on Foata normal form. 23/9235 useless extension candidates. Maximal degree in co-relation 90490. Up to 8639 conditions per place. [2024-06-03 19:08:06,411 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 899 selfloop transitions, 55 changer transitions 0/969 dead transitions. [2024-06-03 19:08:06,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 969 transitions, 18242 flow [2024-06-03 19:08:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:08:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:08:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-03 19:08:06,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42768595041322316 [2024-06-03 19:08:06,414 INFO L175 Difference]: Start difference. First operand has 337 places, 928 transitions, 16031 flow. Second operand 11 states and 207 transitions. [2024-06-03 19:08:06,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 969 transitions, 18242 flow [2024-06-03 19:08:08,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 969 transitions, 18013 flow, removed 52 selfloop flow, removed 5 redundant places. [2024-06-03 19:08:08,692 INFO L231 Difference]: Finished difference. Result has 344 places, 932 transitions, 16057 flow [2024-06-03 19:08:08,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15802, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=873, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16057, PETRI_PLACES=344, PETRI_TRANSITIONS=932} [2024-06-03 19:08:08,693 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 299 predicate places. [2024-06-03 19:08:08,693 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 932 transitions, 16057 flow [2024-06-03 19:08:08,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:08:08,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:08:08,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:08:08,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 19:08:08,694 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:08:08,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:08:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1039245777, now seen corresponding path program 1 times [2024-06-03 19:08:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:08:08,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727555220] [2024-06-03 19:08:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:08:08,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:08:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:08:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:08:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:08:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727555220] [2024-06-03 19:08:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727555220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:08:09,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:08:09,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 19:08:09,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404119519] [2024-06-03 19:08:09,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:08:09,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 19:08:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:08:09,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 19:08:09,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 19:08:10,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:08:10,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 932 transitions, 16057 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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) [2024-06-03 19:08:10,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:08:10,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:08:10,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:08:12,625 INFO L124 PetriNetUnfolderBase]: 6563/10022 cut-off events. [2024-06-03 19:08:12,626 INFO L125 PetriNetUnfolderBase]: For 1000235/1000578 co-relation queries the response was YES. [2024-06-03 19:08:12,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95223 conditions, 10022 events. 6563/10022 cut-off events. For 1000235/1000578 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 61263 event pairs, 1834 based on Foata normal form. 117/10016 useless extension candidates. Maximal degree in co-relation 95070. Up to 8984 conditions per place. [2024-06-03 19:08:12,799 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 736 selfloop transitions, 60 changer transitions 0/984 dead transitions. [2024-06-03 19:08:12,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 984 transitions, 18409 flow [2024-06-03 19:08:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 19:08:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 19:08:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-03 19:08:12,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45202020202020204 [2024-06-03 19:08:12,800 INFO L175 Difference]: Start difference. First operand has 344 places, 932 transitions, 16057 flow. Second operand 9 states and 179 transitions. [2024-06-03 19:08:12,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 984 transitions, 18409 flow [2024-06-03 19:08:14,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 984 transitions, 18202 flow, removed 52 selfloop flow, removed 8 redundant places. [2024-06-03 19:08:14,985 INFO L231 Difference]: Finished difference. Result has 349 places, 954 transitions, 16287 flow [2024-06-03 19:08:14,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15850, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16287, PETRI_PLACES=349, PETRI_TRANSITIONS=954} [2024-06-03 19:08:14,985 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 304 predicate places. [2024-06-03 19:08:14,986 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 954 transitions, 16287 flow [2024-06-03 19:08:14,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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) [2024-06-03 19:08:14,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:08:14,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:08:14,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 19:08:14,986 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:08:14,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:08:14,987 INFO L85 PathProgramCache]: Analyzing trace with hash 487706396, now seen corresponding path program 1 times [2024-06-03 19:08:14,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:08:14,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108680846] [2024-06-03 19:08:14,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:08:14,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:08:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:08:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:08:16,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:08:16,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108680846] [2024-06-03 19:08:16,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108680846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:08:16,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:08:16,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:08:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875468717] [2024-06-03 19:08:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:08:16,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:08:16,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:08:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:08:16,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:08:16,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:08:16,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 954 transitions, 16287 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 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) [2024-06-03 19:08:16,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:08:16,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:08:16,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:08:19,126 INFO L124 PetriNetUnfolderBase]: 6374/9789 cut-off events. [2024-06-03 19:08:19,126 INFO L125 PetriNetUnfolderBase]: For 1094422/1094481 co-relation queries the response was YES. [2024-06-03 19:08:19,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98787 conditions, 9789 events. 6374/9789 cut-off events. For 1094422/1094481 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 60556 event pairs, 1271 based on Foata normal form. 35/9779 useless extension candidates. Maximal degree in co-relation 98629. Up to 7845 conditions per place. [2024-06-03 19:08:19,283 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 798 selfloop transitions, 213 changer transitions 0/1028 dead transitions. [2024-06-03 19:08:19,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1028 transitions, 19494 flow [2024-06-03 19:08:19,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 19:08:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 19:08:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2024-06-03 19:08:19,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46503496503496505 [2024-06-03 19:08:19,284 INFO L175 Difference]: Start difference. First operand has 349 places, 954 transitions, 16287 flow. Second operand 13 states and 266 transitions. [2024-06-03 19:08:19,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1028 transitions, 19494 flow [2024-06-03 19:08:21,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1028 transitions, 19431 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-03 19:08:21,739 INFO L231 Difference]: Finished difference. Result has 360 places, 956 transitions, 16790 flow [2024-06-03 19:08:21,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16224, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=16790, PETRI_PLACES=360, PETRI_TRANSITIONS=956} [2024-06-03 19:08:21,741 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 315 predicate places. [2024-06-03 19:08:21,741 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 956 transitions, 16790 flow [2024-06-03 19:08:21,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 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) [2024-06-03 19:08:21,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:08:21,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:08:21,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 19:08:21,742 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:08:21,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:08:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1129604385, now seen corresponding path program 2 times [2024-06-03 19:08:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:08:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311247021] [2024-06-03 19:08:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:08:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:08:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:08:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:08:22,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:08:22,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311247021] [2024-06-03 19:08:22,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311247021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:08:22,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:08:22,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:08:22,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216588701] [2024-06-03 19:08:22,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:08:22,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:08:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:08:22,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:08:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:08:22,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:08:22,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 956 transitions, 16790 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-06-03 19:08:22,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:08:22,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:08:22,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:08:25,891 INFO L124 PetriNetUnfolderBase]: 6782/10388 cut-off events. [2024-06-03 19:08:25,891 INFO L125 PetriNetUnfolderBase]: For 1135157/1135500 co-relation queries the response was YES. [2024-06-03 19:08:26,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102532 conditions, 10388 events. 6782/10388 cut-off events. For 1135157/1135500 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 64150 event pairs, 2011 based on Foata normal form. 117/10382 useless extension candidates. Maximal degree in co-relation 102372. Up to 9400 conditions per place. [2024-06-03 19:08:26,152 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 746 selfloop transitions, 48 changer transitions 0/982 dead transitions. [2024-06-03 19:08:26,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 982 transitions, 18666 flow [2024-06-03 19:08:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:08:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:08:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-03 19:08:26,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403409090909091 [2024-06-03 19:08:26,154 INFO L175 Difference]: Start difference. First operand has 360 places, 956 transitions, 16790 flow. Second operand 8 states and 155 transitions. [2024-06-03 19:08:26,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 982 transitions, 18666 flow [2024-06-03 19:08:28,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 982 transitions, 18413 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-03 19:08:28,843 INFO L231 Difference]: Finished difference. Result has 361 places, 958 transitions, 16698 flow [2024-06-03 19:08:28,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16539, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=956, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16698, PETRI_PLACES=361, PETRI_TRANSITIONS=958} [2024-06-03 19:08:28,844 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 316 predicate places. [2024-06-03 19:08:28,844 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 958 transitions, 16698 flow [2024-06-03 19:08:28,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-06-03 19:08:28,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:08:28,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:08:28,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 19:08:28,845 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:08:28,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:08:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1255505018, now seen corresponding path program 2 times [2024-06-03 19:08:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:08:28,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488047726] [2024-06-03 19:08:28,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:08:28,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:08:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:08:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:08:30,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:08:30,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488047726] [2024-06-03 19:08:30,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488047726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:08:30,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:08:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:08:30,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346124029] [2024-06-03 19:08:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:08:30,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:08:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:08:30,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:08:30,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:08:30,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:08:30,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 958 transitions, 16698 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 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) [2024-06-03 19:08:30,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:08:30,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:08:30,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:08:34,445 INFO L124 PetriNetUnfolderBase]: 6700/10326 cut-off events. [2024-06-03 19:08:34,445 INFO L125 PetriNetUnfolderBase]: For 1256316/1256417 co-relation queries the response was YES. [2024-06-03 19:08:34,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107188 conditions, 10326 events. 6700/10326 cut-off events. For 1256316/1256417 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 64855 event pairs, 1523 based on Foata normal form. 35/10313 useless extension candidates. Maximal degree in co-relation 107025. Up to 8685 conditions per place. [2024-06-03 19:08:34,619 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 865 selfloop transitions, 139 changer transitions 0/1022 dead transitions. [2024-06-03 19:08:34,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1022 transitions, 19517 flow [2024-06-03 19:08:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 19:08:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 19:08:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 244 transitions. [2024-06-03 19:08:34,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-03 19:08:34,620 INFO L175 Difference]: Start difference. First operand has 361 places, 958 transitions, 16698 flow. Second operand 12 states and 244 transitions. [2024-06-03 19:08:34,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1022 transitions, 19517 flow [2024-06-03 19:08:37,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1022 transitions, 19440 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-03 19:08:37,538 INFO L231 Difference]: Finished difference. Result has 368 places, 962 transitions, 17174 flow [2024-06-03 19:08:37,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16621, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17174, PETRI_PLACES=368, PETRI_TRANSITIONS=962} [2024-06-03 19:08:37,539 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 323 predicate places. [2024-06-03 19:08:37,539 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 962 transitions, 17174 flow [2024-06-03 19:08:37,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 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) [2024-06-03 19:08:37,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:08:37,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:08:37,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 19:08:37,539 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:08:37,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:08:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2045043923, now seen corresponding path program 3 times [2024-06-03 19:08:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:08:37,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309915571] [2024-06-03 19:08:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:08:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:08:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:08:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:08:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:08:38,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309915571] [2024-06-03 19:08:38,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309915571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:08:38,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:08:38,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 19:08:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199077746] [2024-06-03 19:08:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:08:38,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 19:08:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:08:38,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 19:08:38,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 19:08:38,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:08:38,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 962 transitions, 17174 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-06-03 19:08:38,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:08:38,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:08:38,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:08:42,474 INFO L124 PetriNetUnfolderBase]: 7151/10984 cut-off events. [2024-06-03 19:08:42,475 INFO L125 PetriNetUnfolderBase]: For 1319588/1319895 co-relation queries the response was YES. [2024-06-03 19:08:42,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112477 conditions, 10984 events. 7151/10984 cut-off events. For 1319588/1319895 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 68646 event pairs, 2252 based on Foata normal form. 98/10944 useless extension candidates. Maximal degree in co-relation 112312. Up to 10035 conditions per place. [2024-06-03 19:08:42,642 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 762 selfloop transitions, 30 changer transitions 0/980 dead transitions. [2024-06-03 19:08:42,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 980 transitions, 18830 flow [2024-06-03 19:08:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 19:08:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 19:08:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-03 19:08:42,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-06-03 19:08:42,643 INFO L175 Difference]: Start difference. First operand has 368 places, 962 transitions, 17174 flow. Second operand 8 states and 148 transitions. [2024-06-03 19:08:42,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 980 transitions, 18830 flow [2024-06-03 19:08:45,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 980 transitions, 18619 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-03 19:08:45,619 INFO L231 Difference]: Finished difference. Result has 368 places, 962 transitions, 17029 flow [2024-06-03 19:08:45,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16963, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17029, PETRI_PLACES=368, PETRI_TRANSITIONS=962} [2024-06-03 19:08:45,620 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 323 predicate places. [2024-06-03 19:08:45,620 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 962 transitions, 17029 flow [2024-06-03 19:08:45,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-06-03 19:08:45,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:08:45,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:08:45,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 19:08:45,621 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:08:45,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:08:45,621 INFO L85 PathProgramCache]: Analyzing trace with hash 705181320, now seen corresponding path program 3 times [2024-06-03 19:08:45,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:08:45,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309336635] [2024-06-03 19:08:45,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:08:45,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:08:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:08:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:08:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:08:46,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309336635] [2024-06-03 19:08:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309336635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:08:46,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:08:46,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:08:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709457206] [2024-06-03 19:08:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:08:46,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:08:46,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:08:46,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:08:46,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:08:47,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:08:47,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 962 transitions, 17029 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 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) [2024-06-03 19:08:47,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:08:47,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:08:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:08:51,273 INFO L124 PetriNetUnfolderBase]: 7480/11529 cut-off events. [2024-06-03 19:08:51,273 INFO L125 PetriNetUnfolderBase]: For 1373990/1374071 co-relation queries the response was YES. [2024-06-03 19:08:51,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117657 conditions, 11529 events. 7480/11529 cut-off events. For 1373990/1374071 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 74069 event pairs, 1238 based on Foata normal form. 66/11548 useless extension candidates. Maximal degree in co-relation 117490. Up to 7585 conditions per place. [2024-06-03 19:08:51,472 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 561 selfloop transitions, 631 changer transitions 0/1210 dead transitions. [2024-06-03 19:08:51,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1210 transitions, 23125 flow [2024-06-03 19:08:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:08:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:08:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 237 transitions. [2024-06-03 19:08:51,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896694214876033 [2024-06-03 19:08:51,474 INFO L175 Difference]: Start difference. First operand has 368 places, 962 transitions, 17029 flow. Second operand 11 states and 237 transitions. [2024-06-03 19:08:51,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 1210 transitions, 23125 flow [2024-06-03 19:08:54,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 1210 transitions, 23038 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 19:08:54,992 INFO L231 Difference]: Finished difference. Result has 373 places, 1127 transitions, 21188 flow [2024-06-03 19:08:54,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16942, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=494, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21188, PETRI_PLACES=373, PETRI_TRANSITIONS=1127} [2024-06-03 19:08:54,993 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 328 predicate places. [2024-06-03 19:08:54,993 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 1127 transitions, 21188 flow [2024-06-03 19:08:54,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 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) [2024-06-03 19:08:54,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:08:54,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:08:54,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 19:08:54,994 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:08:54,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:08:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2138773955, now seen corresponding path program 12 times [2024-06-03 19:08:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:08:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151878778] [2024-06-03 19:08:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:08:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:08:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:08:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:08:56,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:08:56,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151878778] [2024-06-03 19:08:56,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151878778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:08:56,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:08:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:08:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767275404] [2024-06-03 19:08:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:08:56,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:08:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:08:56,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:08:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:08:56,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:08:56,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1127 transitions, 21188 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:08:56,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:08:56,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:08:56,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:09:01,251 INFO L124 PetriNetUnfolderBase]: 7547/11603 cut-off events. [2024-06-03 19:09:01,252 INFO L125 PetriNetUnfolderBase]: For 1416580/1416685 co-relation queries the response was YES. [2024-06-03 19:09:01,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123441 conditions, 11603 events. 7547/11603 cut-off events. For 1416580/1416685 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 74642 event pairs, 1453 based on Foata normal form. 27/11559 useless extension candidates. Maximal degree in co-relation 123272. Up to 10056 conditions per place. [2024-06-03 19:09:01,460 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 916 selfloop transitions, 246 changer transitions 0/1180 dead transitions. [2024-06-03 19:09:01,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1180 transitions, 24166 flow [2024-06-03 19:09:01,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:09:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:09:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-06-03 19:09:01,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4462809917355372 [2024-06-03 19:09:01,462 INFO L175 Difference]: Start difference. First operand has 373 places, 1127 transitions, 21188 flow. Second operand 11 states and 216 transitions. [2024-06-03 19:09:01,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1180 transitions, 24166 flow [2024-06-03 19:09:05,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1180 transitions, 23941 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-03 19:09:05,363 INFO L231 Difference]: Finished difference. Result has 380 places, 1131 transitions, 21628 flow [2024-06-03 19:09:05,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=20963, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21628, PETRI_PLACES=380, PETRI_TRANSITIONS=1131} [2024-06-03 19:09:05,364 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 335 predicate places. [2024-06-03 19:09:05,364 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 1131 transitions, 21628 flow [2024-06-03 19:09:05,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:09:05,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:09:05,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:09:05,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 19:09:05,365 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:09:05,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:09:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2138834405, now seen corresponding path program 13 times [2024-06-03 19:09:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:09:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935046959] [2024-06-03 19:09:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:09:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:09:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:09:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:09:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:09:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935046959] [2024-06-03 19:09:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935046959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:09:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:09:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:09:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361756111] [2024-06-03 19:09:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:09:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:09:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:09:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:09:06,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:09:06,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:09:06,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1131 transitions, 21628 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:09:06,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:09:06,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:09:06,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:09:11,229 INFO L124 PetriNetUnfolderBase]: 7491/11548 cut-off events. [2024-06-03 19:09:11,229 INFO L125 PetriNetUnfolderBase]: For 1397523/1397576 co-relation queries the response was YES. [2024-06-03 19:09:11,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122651 conditions, 11548 events. 7491/11548 cut-off events. For 1397523/1397576 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 74365 event pairs, 1796 based on Foata normal form. 14/11503 useless extension candidates. Maximal degree in co-relation 122480. Up to 10369 conditions per place. [2024-06-03 19:09:11,474 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 957 selfloop transitions, 201 changer transitions 0/1176 dead transitions. [2024-06-03 19:09:11,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1176 transitions, 24178 flow [2024-06-03 19:09:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:09:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:09:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2024-06-03 19:09:11,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2024-06-03 19:09:11,475 INFO L175 Difference]: Start difference. First operand has 380 places, 1131 transitions, 21628 flow. Second operand 11 states and 212 transitions. [2024-06-03 19:09:11,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 1176 transitions, 24178 flow [2024-06-03 19:09:15,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 1176 transitions, 23587 flow, removed 110 selfloop flow, removed 8 redundant places. [2024-06-03 19:09:15,940 INFO L231 Difference]: Finished difference. Result has 383 places, 1131 transitions, 21501 flow [2024-06-03 19:09:15,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=21037, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21501, PETRI_PLACES=383, PETRI_TRANSITIONS=1131} [2024-06-03 19:09:15,941 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 338 predicate places. [2024-06-03 19:09:15,941 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 1131 transitions, 21501 flow [2024-06-03 19:09:15,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:09:15,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 19:09:15,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 19:09:15,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 19:09:15,942 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 19:09:15,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 19:09:15,942 INFO L85 PathProgramCache]: Analyzing trace with hash -775209971, now seen corresponding path program 3 times [2024-06-03 19:09:15,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 19:09:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577214418] [2024-06-03 19:09:15,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 19:09:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 19:09:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 19:09:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 19:09:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 19:09:17,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577214418] [2024-06-03 19:09:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577214418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 19:09:17,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 19:09:17,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 19:09:17,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304662956] [2024-06-03 19:09:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 19:09:17,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 19:09:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 19:09:17,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 19:09:17,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 19:09:17,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-03 19:09:17,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1131 transitions, 21501 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 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) [2024-06-03 19:09:17,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 19:09:17,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-03 19:09:17,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 19:09:21,756 INFO L124 PetriNetUnfolderBase]: 7663/11849 cut-off events. [2024-06-03 19:09:21,756 INFO L125 PetriNetUnfolderBase]: For 1303453/1303486 co-relation queries the response was YES. [2024-06-03 19:09:21,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123053 conditions, 11849 events. 7663/11849 cut-off events. For 1303453/1303486 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 77030 event pairs, 1759 based on Foata normal form. 12/11816 useless extension candidates. Maximal degree in co-relation 122881. Up to 10365 conditions per place. [2024-06-03 19:09:21,981 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 966 selfloop transitions, 233 changer transitions 0/1217 dead transitions. [2024-06-03 19:09:21,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 1217 transitions, 25040 flow [2024-06-03 19:09:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 19:09:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 19:09:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-06-03 19:09:21,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-03 19:09:21,983 INFO L175 Difference]: Start difference. First operand has 383 places, 1131 transitions, 21501 flow. Second operand 11 states and 220 transitions. [2024-06-03 19:09:21,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 1217 transitions, 25040 flow