./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix003.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-06-19_11-23-25.files/mutex-meet-rel/mix003.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix003.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix003.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-7724a2d-m [2024-06-27 23:08:33,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:08:33,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:08:33,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:08:33,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:08:33,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:08:33,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:08:33,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:08:33,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:08:33,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:08:33,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:08:33,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:08:33,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:08:33,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:08:33,517 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:08:33,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:08:33,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:08:33,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:08:33,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:08:33,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:08:33,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:08:33,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:08:33,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:08:33,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:08:33,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:08:33,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:08:33,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:08:33,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:08:33,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:08:33,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:08:33,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:08:33,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:08:33,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:08:33,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:08:33,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:08:33,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:08:33,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:08:33,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:08:33,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:08:33,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:08:33,528 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:08:33,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:08:33,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:08:33,528 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-27 23:08:33,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:08:33,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:08:33,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:08:33,793 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:08:33,794 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:08:33,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix003.oepc.yml/witness.yml [2024-06-27 23:08:33,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:08:33,911 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:08:33,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-06-27 23:08:35,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:08:35,285 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:08:35,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2024-06-27 23:08:35,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d82d6cb/e0267d339c324c60826405978a1b8778/FLAG14b091913 [2024-06-27 23:08:35,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d82d6cb/e0267d339c324c60826405978a1b8778 [2024-06-27 23:08:35,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:08:35,315 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:08:35,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:08:35,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:08:35,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:08:35,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:08:33" (1/2) ... [2024-06-27 23:08:35,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35242e3e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:08:35, skipping insertion in model container [2024-06-27 23:08:35,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:08:33" (1/2) ... [2024-06-27 23:08:35,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@79ea0183 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:08:35, skipping insertion in model container [2024-06-27 23:08:35,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:08:35" (2/2) ... [2024-06-27 23:08:35,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35242e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:35, skipping insertion in model container [2024-06-27 23:08:35,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:08:35" (2/2) ... [2024-06-27 23:08:35,327 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:08:35,358 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:08:35,359 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 23:08:35,359 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 23:08:35,359 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0_used >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff0_used >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff0_used >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff0_used >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0_used >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0_used + (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0_used >= 0LL) && (1LL + (long long )z$w_buff0_used) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$mem_tmp >= 0LL) && (long long )z - (long long )z$mem_tmp >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff0_used >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff0_used - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) [2024-06-27 23:08:35,360 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:08:35,360 INFO L106 edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1; [2024-06-27 23:08:35,405 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:08:35,833 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:08:35,844 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:08:36,096 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:08:36,137 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:08:36,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36 WrapperNode [2024-06-27 23:08:36,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:08:36,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:08:36,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:08:36,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:08:36,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,243 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-06-27 23:08:36,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:08:36,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:08:36,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:08:36,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:08:36,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,307 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-27 23:08:36,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:08:36,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:08:36,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:08:36,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:08:36,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (1/1) ... [2024-06-27 23:08:36,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:08:36,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:08:36,390 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-27 23:08:36,400 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-27 23:08:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:08:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:08:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:08:36,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:08:36,425 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:08:36,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:08:36,425 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:08:36,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:08:36,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:08:36,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:08:36,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:08:36,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:08:36,427 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:08:36,554 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:08:36,556 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:08:37,162 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:08:37,164 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:08:37,378 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:08:37,379 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:08:37,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:08:37 BoogieIcfgContainer [2024-06-27 23:08:37,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:08:37,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:08:37,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:08:37,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:08:37,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:08:33" (1/4) ... [2024-06-27 23:08:37,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b975d15 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:08:37, skipping insertion in model container [2024-06-27 23:08:37,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:08:35" (2/4) ... [2024-06-27 23:08:37,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b975d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:08:37, skipping insertion in model container [2024-06-27 23:08:37,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:08:36" (3/4) ... [2024-06-27 23:08:37,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b975d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:08:37, skipping insertion in model container [2024-06-27 23:08:37,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:08:37" (4/4) ... [2024-06-27 23:08:37,391 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2024-06-27 23:08:37,407 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:08:37,407 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 23:08:37,407 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:08:37,470 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:08:37,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-27 23:08:37,544 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-27 23:08:37,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:08:37,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:08:37,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-27 23:08:37,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-27 23:08:37,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:08:37,572 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;@10e6e84e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:08:37,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 23:08:37,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:08:37,579 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:08:37,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:08:37,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:37,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:08:37,581 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-27 23:08:37,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 380730443, now seen corresponding path program 1 times [2024-06-27 23:08:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:37,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950030642] [2024-06-27 23:08:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:39,571 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-27 23:08:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:39,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950030642] [2024-06-27 23:08:39,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950030642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:39,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:39,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:08:39,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201265870] [2024-06-27 23:08:39,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:39,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:08:39,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:08:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:08:39,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-06-27 23:08:39,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-27 23:08:39,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:39,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-06-27 23:08:39,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:40,177 INFO L124 PetriNetUnfolderBase]: 1116/1766 cut-off events. [2024-06-27 23:08:40,177 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-27 23:08:40,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 1766 events. 1116/1766 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8814 event pairs, 765 based on Foata normal form. 1/1713 useless extension candidates. Maximal degree in co-relation 3505. Up to 1676 conditions per place. [2024-06-27 23:08:40,195 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 31 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-27 23:08:40,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow [2024-06-27 23:08:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:08:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:08:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-27 23:08:40,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2024-06-27 23:08:40,208 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 80 transitions. [2024-06-27 23:08:40,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow [2024-06-27 23:08:40,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 23:08:40,214 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-27 23:08:40,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-27 23:08:40,219 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-27 23:08:40,219 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-27 23:08:40,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-27 23:08:40,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:40,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:40,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:08:40,220 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-27 23:08:40,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 810521078, now seen corresponding path program 1 times [2024-06-27 23:08:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149538928] [2024-06-27 23:08:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:41,596 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-27 23:08:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149538928] [2024-06-27 23:08:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149538928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:08:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988362537] [2024-06-27 23:08:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:41,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:08:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:41,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:08:41,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:08:41,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-06-27 23:08:41,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-27 23:08:41,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:41,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-06-27 23:08:41,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:42,130 INFO L124 PetriNetUnfolderBase]: 1110/1773 cut-off events. [2024-06-27 23:08:42,130 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-06-27 23:08:42,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 1773 events. 1110/1773 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8861 event pairs, 641 based on Foata normal form. 3/1758 useless extension candidates. Maximal degree in co-relation 3982. Up to 1652 conditions per place. [2024-06-27 23:08:42,141 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 38 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-27 23:08:42,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 238 flow [2024-06-27 23:08:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:08:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:08:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-27 23:08:42,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-06-27 23:08:42,143 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 104 transitions. [2024-06-27 23:08:42,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 238 flow [2024-06-27 23:08:42,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:08:42,145 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-27 23:08:42,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-27 23:08:42,146 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-27 23:08:42,147 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-27 23:08:42,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-27 23:08:42,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:42,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:42,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:08:42,148 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-27 23:08:42,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1521713301, now seen corresponding path program 1 times [2024-06-27 23:08:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253763321] [2024-06-27 23:08:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:44,363 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-27 23:08:44,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:44,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253763321] [2024-06-27 23:08:44,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253763321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:44,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:44,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616583724] [2024-06-27 23:08:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:44,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:44,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:44,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:44,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-27 23:08:44,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-27 23:08:44,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:44,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-27 23:08:44,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:45,020 INFO L124 PetriNetUnfolderBase]: 1345/2122 cut-off events. [2024-06-27 23:08:45,021 INFO L125 PetriNetUnfolderBase]: For 1153/1153 co-relation queries the response was YES. [2024-06-27 23:08:45,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5301 conditions, 2122 events. 1345/2122 cut-off events. For 1153/1153 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10709 event pairs, 592 based on Foata normal form. 3/2102 useless extension candidates. Maximal degree in co-relation 5287. Up to 1965 conditions per place. [2024-06-27 23:08:45,037 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 53 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2024-06-27 23:08:45,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 372 flow [2024-06-27 23:08:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:08:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:08:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-27 23:08:45,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-27 23:08:45,043 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 6 states and 147 transitions. [2024-06-27 23:08:45,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 372 flow [2024-06-27 23:08:45,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 352 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 23:08:45,047 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 196 flow [2024-06-27 23:08:45,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-27 23:08:45,049 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-27 23:08:45,049 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 196 flow [2024-06-27 23:08:45,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-27 23:08:45,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:45,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:45,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:08:45,050 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-27 23:08:45,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -927427979, now seen corresponding path program 1 times [2024-06-27 23:08:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:45,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384869469] [2024-06-27 23:08:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:47,875 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-27 23:08:47,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:47,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384869469] [2024-06-27 23:08:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384869469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:47,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:08:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700080389] [2024-06-27 23:08:47,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:47,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:08:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:47,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:08:47,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:08:48,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-27 23:08:48,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 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-27 23:08:48,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:48,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-27 23:08:48,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:48,652 INFO L124 PetriNetUnfolderBase]: 1336/2103 cut-off events. [2024-06-27 23:08:48,653 INFO L125 PetriNetUnfolderBase]: For 2265/2265 co-relation queries the response was YES. [2024-06-27 23:08:48,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 2103 events. 1336/2103 cut-off events. For 2265/2265 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10534 event pairs, 450 based on Foata normal form. 6/2084 useless extension candidates. Maximal degree in co-relation 5856. Up to 1920 conditions per place. [2024-06-27 23:08:48,667 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 57 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2024-06-27 23:08:48,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 432 flow [2024-06-27 23:08:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:08:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:08:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-27 23:08:48,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2024-06-27 23:08:48,670 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 196 flow. Second operand 7 states and 166 transitions. [2024-06-27 23:08:48,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 432 flow [2024-06-27 23:08:48,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 404 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 23:08:48,676 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 217 flow [2024-06-27 23:08:48,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-27 23:08:48,678 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-06-27 23:08:48,678 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 217 flow [2024-06-27 23:08:48,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 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-27 23:08:48,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:48,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:48,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:08:48,679 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-27 23:08:48,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1592598440, now seen corresponding path program 1 times [2024-06-27 23:08:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:48,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763953750] [2024-06-27 23:08:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:50,605 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-27 23:08:50,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:50,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763953750] [2024-06-27 23:08:50,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763953750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:50,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:50,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:08:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660988863] [2024-06-27 23:08:50,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:50,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:08:50,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:50,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:08:50,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:08:50,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:08:50,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-27 23:08:50,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:50,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:08:50,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:51,356 INFO L124 PetriNetUnfolderBase]: 1627/2507 cut-off events. [2024-06-27 23:08:51,356 INFO L125 PetriNetUnfolderBase]: For 4170/4170 co-relation queries the response was YES. [2024-06-27 23:08:51,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7415 conditions, 2507 events. 1627/2507 cut-off events. For 4170/4170 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12312 event pairs, 963 based on Foata normal form. 2/2491 useless extension candidates. Maximal degree in co-relation 7397. Up to 2407 conditions per place. [2024-06-27 23:08:51,374 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 46 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-27 23:08:51,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 382 flow [2024-06-27 23:08:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:08:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:08:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-06-27 23:08:51,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 23:08:51,376 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 217 flow. Second operand 5 states and 97 transitions. [2024-06-27 23:08:51,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 382 flow [2024-06-27 23:08:51,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 341 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 23:08:51,380 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 244 flow [2024-06-27 23:08:51,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-06-27 23:08:51,381 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-06-27 23:08:51,381 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 244 flow [2024-06-27 23:08:51,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-27 23:08:51,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:51,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:51,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:08:51,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:08:51,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2125910344, now seen corresponding path program 1 times [2024-06-27 23:08:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622330828] [2024-06-27 23:08:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:53,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-27 23:08:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622330828] [2024-06-27 23:08:53,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622330828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:53,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:53,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888521344] [2024-06-27 23:08:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:53,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:53,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:53,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:53,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:53,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:08:53,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 244 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-27 23:08:53,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:53,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:08:53,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:54,610 INFO L124 PetriNetUnfolderBase]: 1617/2511 cut-off events. [2024-06-27 23:08:54,610 INFO L125 PetriNetUnfolderBase]: For 5687/5687 co-relation queries the response was YES. [2024-06-27 23:08:54,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7879 conditions, 2511 events. 1617/2511 cut-off events. For 5687/5687 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12385 event pairs, 927 based on Foata normal form. 4/2500 useless extension candidates. Maximal degree in co-relation 7857. Up to 2375 conditions per place. [2024-06-27 23:08:54,626 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 51 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-27 23:08:54,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 430 flow [2024-06-27 23:08:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:08:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:08:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 23:08:54,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-27 23:08:54,628 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 244 flow. Second operand 6 states and 115 transitions. [2024-06-27 23:08:54,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 430 flow [2024-06-27 23:08:54,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 412 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:08:54,633 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 288 flow [2024-06-27 23:08:54,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-06-27 23:08:54,636 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-06-27 23:08:54,637 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 288 flow [2024-06-27 23:08:54,637 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-27 23:08:54,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:54,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:54,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:08:54,637 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-27 23:08:54,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash -741600209, now seen corresponding path program 1 times [2024-06-27 23:08:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:54,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000005186] [2024-06-27 23:08:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:54,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:56,571 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-27 23:08:56,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:56,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000005186] [2024-06-27 23:08:56,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000005186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:56,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:56,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:56,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526698382] [2024-06-27 23:08:56,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:56,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:56,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:56,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:08:56,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 288 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-27 23:08:56,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:56,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:08:56,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:57,404 INFO L124 PetriNetUnfolderBase]: 1650/2555 cut-off events. [2024-06-27 23:08:57,405 INFO L125 PetriNetUnfolderBase]: For 7657/7663 co-relation queries the response was YES. [2024-06-27 23:08:57,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8644 conditions, 2555 events. 1650/2555 cut-off events. For 7657/7663 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12629 event pairs, 872 based on Foata normal form. 6/2559 useless extension candidates. Maximal degree in co-relation 8619. Up to 2393 conditions per place. [2024-06-27 23:08:57,433 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 62 selfloop transitions, 24 changer transitions 0/91 dead transitions. [2024-06-27 23:08:57,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 643 flow [2024-06-27 23:08:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:08:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:08:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 23:08:57,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 23:08:57,436 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 288 flow. Second operand 7 states and 140 transitions. [2024-06-27 23:08:57,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 643 flow [2024-06-27 23:08:57,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 611 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 23:08:57,443 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 429 flow [2024-06-27 23:08:57,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2024-06-27 23:08:57,445 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-27 23:08:57,445 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 429 flow [2024-06-27 23:08:57,445 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-27 23:08:57,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:57,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:57,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:08:57,446 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-27 23:08:57,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1484432009, now seen corresponding path program 2 times [2024-06-27 23:08:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:57,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397845928] [2024-06-27 23:08:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:08:59,198 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-27 23:08:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:08:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397845928] [2024-06-27 23:08:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397845928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:08:59,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:08:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:08:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218532075] [2024-06-27 23:08:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:08:59,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:08:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:08:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:08:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:08:59,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:08:59,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 429 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-27 23:08:59,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:08:59,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:08:59,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:08:59,905 INFO L124 PetriNetUnfolderBase]: 1682/2607 cut-off events. [2024-06-27 23:08:59,906 INFO L125 PetriNetUnfolderBase]: For 10247/10253 co-relation queries the response was YES. [2024-06-27 23:08:59,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9588 conditions, 2607 events. 1682/2607 cut-off events. For 10247/10253 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12777 event pairs, 922 based on Foata normal form. 7/2600 useless extension candidates. Maximal degree in co-relation 9560. Up to 2444 conditions per place. [2024-06-27 23:08:59,920 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 62 selfloop transitions, 30 changer transitions 0/97 dead transitions. [2024-06-27 23:08:59,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 815 flow [2024-06-27 23:08:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:08:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:08:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-27 23:08:59,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 23:08:59,923 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 429 flow. Second operand 6 states and 119 transitions. [2024-06-27 23:08:59,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 815 flow [2024-06-27 23:08:59,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 770 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-27 23:08:59,938 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 613 flow [2024-06-27 23:08:59,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=613, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2024-06-27 23:08:59,939 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-27 23:08:59,939 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 613 flow [2024-06-27 23:08:59,939 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-27 23:08:59,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:08:59,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:08:59,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:08:59,940 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-27 23:08:59,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:08:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1134632039, now seen corresponding path program 3 times [2024-06-27 23:08:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:08:59,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681297902] [2024-06-27 23:08:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:08:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:08:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:01,593 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-27 23:09:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681297902] [2024-06-27 23:09:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681297902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:01,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:01,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:09:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254170162] [2024-06-27 23:09:01,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:01,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:09:01,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:01,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:09:01,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:09:01,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:01,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 613 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-27 23:09:01,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:01,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:01,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:02,294 INFO L124 PetriNetUnfolderBase]: 1674/2595 cut-off events. [2024-06-27 23:09:02,294 INFO L125 PetriNetUnfolderBase]: For 11740/11740 co-relation queries the response was YES. [2024-06-27 23:09:02,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9774 conditions, 2595 events. 1674/2595 cut-off events. For 11740/11740 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12731 event pairs, 920 based on Foata normal form. 3/2585 useless extension candidates. Maximal degree in co-relation 9743. Up to 2465 conditions per place. [2024-06-27 23:09:02,312 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 74 selfloop transitions, 16 changer transitions 0/95 dead transitions. [2024-06-27 23:09:02,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 837 flow [2024-06-27 23:09:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:09:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:09:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-27 23:09:02,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:09:02,313 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 613 flow. Second operand 6 states and 114 transitions. [2024-06-27 23:09:02,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 837 flow [2024-06-27 23:09:02,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 95 transitions, 746 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-27 23:09:02,329 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 565 flow [2024-06-27 23:09:02,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=565, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-06-27 23:09:02,330 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2024-06-27 23:09:02,330 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 565 flow [2024-06-27 23:09:02,330 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-27 23:09:02,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:02,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:02,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:09:02,331 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-27 23:09:02,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash -234600913, now seen corresponding path program 1 times [2024-06-27 23:09:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065786027] [2024-06-27 23:09:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:02,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:04,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-27 23:09:04,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:04,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065786027] [2024-06-27 23:09:04,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065786027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:04,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:04,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533460021] [2024-06-27 23:09:04,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:04,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:04,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:04,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:04,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:04,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:04,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 565 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-27 23:09:04,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:04,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:04,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:05,141 INFO L124 PetriNetUnfolderBase]: 1723/2658 cut-off events. [2024-06-27 23:09:05,141 INFO L125 PetriNetUnfolderBase]: For 13771/13774 co-relation queries the response was YES. [2024-06-27 23:09:05,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10231 conditions, 2658 events. 1723/2658 cut-off events. For 13771/13774 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13108 event pairs, 834 based on Foata normal form. 4/2651 useless extension candidates. Maximal degree in co-relation 10199. Up to 2482 conditions per place. [2024-06-27 23:09:05,159 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 92 selfloop transitions, 34 changer transitions 0/131 dead transitions. [2024-06-27 23:09:05,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 131 transitions, 1081 flow [2024-06-27 23:09:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:09:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:09:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 23:09:05,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 23:09:05,161 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 565 flow. Second operand 10 states and 189 transitions. [2024-06-27 23:09:05,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 131 transitions, 1081 flow [2024-06-27 23:09:05,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 131 transitions, 1036 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 23:09:05,178 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 728 flow [2024-06-27 23:09:05,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2024-06-27 23:09:05,179 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2024-06-27 23:09:05,179 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 728 flow [2024-06-27 23:09:05,180 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-27 23:09:05,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:05,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:05,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:09:05,180 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-27 23:09:05,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1525988665, now seen corresponding path program 2 times [2024-06-27 23:09:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:05,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132695946] [2024-06-27 23:09:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:07,370 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-27 23:09:07,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:07,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132695946] [2024-06-27 23:09:07,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132695946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:07,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:07,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142747809] [2024-06-27 23:09:07,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:07,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:07,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:07,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:07,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 728 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-27 23:09:07,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:07,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:07,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:08,337 INFO L124 PetriNetUnfolderBase]: 1767/2738 cut-off events. [2024-06-27 23:09:08,337 INFO L125 PetriNetUnfolderBase]: For 17392/17395 co-relation queries the response was YES. [2024-06-27 23:09:08,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11293 conditions, 2738 events. 1767/2738 cut-off events. For 17392/17395 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13532 event pairs, 794 based on Foata normal form. 5/2737 useless extension candidates. Maximal degree in co-relation 11259. Up to 2546 conditions per place. [2024-06-27 23:09:08,358 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 93 selfloop transitions, 39 changer transitions 0/137 dead transitions. [2024-06-27 23:09:08,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 1235 flow [2024-06-27 23:09:08,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:09:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:09:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 23:09:08,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 23:09:08,360 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 728 flow. Second operand 8 states and 154 transitions. [2024-06-27 23:09:08,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 1235 flow [2024-06-27 23:09:08,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 137 transitions, 1132 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-27 23:09:08,383 INFO L231 Difference]: Finished difference. Result has 84 places, 113 transitions, 913 flow [2024-06-27 23:09:08,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=913, PETRI_PLACES=84, PETRI_TRANSITIONS=113} [2024-06-27 23:09:08,383 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2024-06-27 23:09:08,384 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 113 transitions, 913 flow [2024-06-27 23:09:08,384 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-27 23:09:08,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:08,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:08,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:09:08,384 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-27 23:09:08,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1515143749, now seen corresponding path program 1 times [2024-06-27 23:09:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:08,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805224828] [2024-06-27 23:09:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:10,443 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-27 23:09:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805224828] [2024-06-27 23:09:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805224828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:10,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859993052] [2024-06-27 23:09:10,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:10,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:10,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:10,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:10,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:10,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 113 transitions, 913 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-27 23:09:10,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:10,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:10,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:11,296 INFO L124 PetriNetUnfolderBase]: 1788/2761 cut-off events. [2024-06-27 23:09:11,296 INFO L125 PetriNetUnfolderBase]: For 20293/20296 co-relation queries the response was YES. [2024-06-27 23:09:11,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11760 conditions, 2761 events. 1788/2761 cut-off events. For 20293/20296 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13643 event pairs, 821 based on Foata normal form. 4/2760 useless extension candidates. Maximal degree in co-relation 11723. Up to 2532 conditions per place. [2024-06-27 23:09:11,315 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 102 selfloop transitions, 46 changer transitions 0/153 dead transitions. [2024-06-27 23:09:11,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 1467 flow [2024-06-27 23:09:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:09:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:09:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-27 23:09:11,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 23:09:11,317 INFO L175 Difference]: Start difference. First operand has 84 places, 113 transitions, 913 flow. Second operand 8 states and 160 transitions. [2024-06-27 23:09:11,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 1467 flow [2024-06-27 23:09:11,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 153 transitions, 1398 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 23:09:11,347 INFO L231 Difference]: Finished difference. Result has 91 places, 126 transitions, 1082 flow [2024-06-27 23:09:11,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1082, PETRI_PLACES=91, PETRI_TRANSITIONS=126} [2024-06-27 23:09:11,348 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-27 23:09:11,348 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 126 transitions, 1082 flow [2024-06-27 23:09:11,349 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-27 23:09:11,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:11,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:11,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:09:11,349 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-27 23:09:11,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1525868695, now seen corresponding path program 3 times [2024-06-27 23:09:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:11,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53102025] [2024-06-27 23:09:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:13,326 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-27 23:09:13,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:13,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53102025] [2024-06-27 23:09:13,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53102025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:13,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:13,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:13,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694797321] [2024-06-27 23:09:13,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:13,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:13,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:13,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:13,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:13,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 126 transitions, 1082 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-27 23:09:13,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:13,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:13,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:14,342 INFO L124 PetriNetUnfolderBase]: 1809/2812 cut-off events. [2024-06-27 23:09:14,342 INFO L125 PetriNetUnfolderBase]: For 24138/24141 co-relation queries the response was YES. [2024-06-27 23:09:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12634 conditions, 2812 events. 1809/2812 cut-off events. For 24138/24141 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13916 event pairs, 769 based on Foata normal form. 4/2814 useless extension candidates. Maximal degree in co-relation 12594. Up to 2501 conditions per place. [2024-06-27 23:09:14,363 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 87 selfloop transitions, 72 changer transitions 0/164 dead transitions. [2024-06-27 23:09:14,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 164 transitions, 1691 flow [2024-06-27 23:09:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:09:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:09:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-27 23:09:14,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 23:09:14,365 INFO L175 Difference]: Start difference. First operand has 91 places, 126 transitions, 1082 flow. Second operand 8 states and 160 transitions. [2024-06-27 23:09:14,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 164 transitions, 1691 flow [2024-06-27 23:09:14,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 1644 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 23:09:14,399 INFO L231 Difference]: Finished difference. Result has 97 places, 137 transitions, 1338 flow [2024-06-27 23:09:14,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1338, PETRI_PLACES=97, PETRI_TRANSITIONS=137} [2024-06-27 23:09:14,400 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2024-06-27 23:09:14,400 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 137 transitions, 1338 flow [2024-06-27 23:09:14,401 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-27 23:09:14,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:14,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:14,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:09:14,401 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-27 23:09:14,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1805361591, now seen corresponding path program 4 times [2024-06-27 23:09:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:14,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101140860] [2024-06-27 23:09:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:14,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:16,117 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-27 23:09:16,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101140860] [2024-06-27 23:09:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101140860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:16,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537399666] [2024-06-27 23:09:16,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:16,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:16,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:16,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:16,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:16,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 137 transitions, 1338 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-27 23:09:16,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:16,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:16,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:17,056 INFO L124 PetriNetUnfolderBase]: 1829/2830 cut-off events. [2024-06-27 23:09:17,057 INFO L125 PetriNetUnfolderBase]: For 29609/29609 co-relation queries the response was YES. [2024-06-27 23:09:17,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13558 conditions, 2830 events. 1829/2830 cut-off events. For 29609/29609 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14027 event pairs, 874 based on Foata normal form. 3/2822 useless extension candidates. Maximal degree in co-relation 13515. Up to 2657 conditions per place. [2024-06-27 23:09:17,075 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 128 selfloop transitions, 34 changer transitions 0/167 dead transitions. [2024-06-27 23:09:17,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 167 transitions, 1846 flow [2024-06-27 23:09:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:09:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:09:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 23:09:17,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:09:17,077 INFO L175 Difference]: Start difference. First operand has 97 places, 137 transitions, 1338 flow. Second operand 7 states and 133 transitions. [2024-06-27 23:09:17,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 167 transitions, 1846 flow [2024-06-27 23:09:17,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 167 transitions, 1746 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-27 23:09:17,116 INFO L231 Difference]: Finished difference. Result has 102 places, 150 transitions, 1488 flow [2024-06-27 23:09:17,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1488, PETRI_PLACES=102, PETRI_TRANSITIONS=150} [2024-06-27 23:09:17,117 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-06-27 23:09:17,117 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 150 transitions, 1488 flow [2024-06-27 23:09:17,117 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-27 23:09:17,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:17,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:17,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:09:17,118 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-27 23:09:17,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1227249017, now seen corresponding path program 2 times [2024-06-27 23:09:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:17,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760519387] [2024-06-27 23:09:17,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:18,856 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-27 23:09:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760519387] [2024-06-27 23:09:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760519387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:18,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947495360] [2024-06-27 23:09:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:18,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:18,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:18,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 150 transitions, 1488 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-27 23:09:18,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:18,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:18,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:19,541 INFO L124 PetriNetUnfolderBase]: 1881/2914 cut-off events. [2024-06-27 23:09:19,541 INFO L125 PetriNetUnfolderBase]: For 33599/33599 co-relation queries the response was YES. [2024-06-27 23:09:19,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14288 conditions, 2914 events. 1881/2914 cut-off events. For 33599/33599 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14571 event pairs, 888 based on Foata normal form. 5/2905 useless extension candidates. Maximal degree in co-relation 14242. Up to 2653 conditions per place. [2024-06-27 23:09:19,557 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 136 selfloop transitions, 46 changer transitions 0/187 dead transitions. [2024-06-27 23:09:19,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 187 transitions, 2152 flow [2024-06-27 23:09:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:09:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:09:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-27 23:09:19,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 23:09:19,559 INFO L175 Difference]: Start difference. First operand has 102 places, 150 transitions, 1488 flow. Second operand 7 states and 140 transitions. [2024-06-27 23:09:19,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 187 transitions, 2152 flow [2024-06-27 23:09:19,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 187 transitions, 2103 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:09:19,598 INFO L231 Difference]: Finished difference. Result has 105 places, 162 transitions, 1685 flow [2024-06-27 23:09:19,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1685, PETRI_PLACES=105, PETRI_TRANSITIONS=162} [2024-06-27 23:09:19,598 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2024-06-27 23:09:19,599 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 162 transitions, 1685 flow [2024-06-27 23:09:19,599 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-27 23:09:19,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:19,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:19,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:09:19,599 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:19,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1180456267, now seen corresponding path program 5 times [2024-06-27 23:09:19,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:19,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210732167] [2024-06-27 23:09:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:21,199 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-27 23:09:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210732167] [2024-06-27 23:09:21,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210732167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:21,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:21,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:21,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480703214] [2024-06-27 23:09:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:21,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:21,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:21,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:21,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:21,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:21,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 162 transitions, 1685 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-27 23:09:21,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:21,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:21,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:21,842 INFO L124 PetriNetUnfolderBase]: 1906/2950 cut-off events. [2024-06-27 23:09:21,843 INFO L125 PetriNetUnfolderBase]: For 38346/38349 co-relation queries the response was YES. [2024-06-27 23:09:21,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15144 conditions, 2950 events. 1906/2950 cut-off events. For 38346/38349 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14765 event pairs, 882 based on Foata normal form. 5/2943 useless extension candidates. Maximal degree in co-relation 15097. Up to 2696 conditions per place. [2024-06-27 23:09:21,857 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 124 selfloop transitions, 62 changer transitions 0/191 dead transitions. [2024-06-27 23:09:21,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 191 transitions, 2299 flow [2024-06-27 23:09:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:09:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:09:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 23:09:21,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-27 23:09:21,858 INFO L175 Difference]: Start difference. First operand has 105 places, 162 transitions, 1685 flow. Second operand 7 states and 138 transitions. [2024-06-27 23:09:21,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 191 transitions, 2299 flow [2024-06-27 23:09:21,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 191 transitions, 2227 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-06-27 23:09:21,893 INFO L231 Difference]: Finished difference. Result has 110 places, 171 transitions, 1857 flow [2024-06-27 23:09:21,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1857, PETRI_PLACES=110, PETRI_TRANSITIONS=171} [2024-06-27 23:09:21,893 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-27 23:09:21,894 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 171 transitions, 1857 flow [2024-06-27 23:09:21,895 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-27 23:09:21,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:21,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:21,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:09:21,895 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-27 23:09:21,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash -813853987, now seen corresponding path program 6 times [2024-06-27 23:09:21,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:21,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17730010] [2024-06-27 23:09:21,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:21,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:23,290 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-27 23:09:23,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:23,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17730010] [2024-06-27 23:09:23,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17730010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:23,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824241583] [2024-06-27 23:09:23,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:23,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:23,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:23,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:23,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:23,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 171 transitions, 1857 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-27 23:09:23,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:23,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:23,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:23,959 INFO L124 PetriNetUnfolderBase]: 1898/2939 cut-off events. [2024-06-27 23:09:23,959 INFO L125 PetriNetUnfolderBase]: For 41834/41834 co-relation queries the response was YES. [2024-06-27 23:09:23,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15419 conditions, 2939 events. 1898/2939 cut-off events. For 41834/41834 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14720 event pairs, 888 based on Foata normal form. 3/2931 useless extension candidates. Maximal degree in co-relation 15369. Up to 2775 conditions per place. [2024-06-27 23:09:23,976 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 162 selfloop transitions, 22 changer transitions 0/189 dead transitions. [2024-06-27 23:09:23,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 189 transitions, 2313 flow [2024-06-27 23:09:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:09:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:09:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 23:09:23,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-27 23:09:23,977 INFO L175 Difference]: Start difference. First operand has 110 places, 171 transitions, 1857 flow. Second operand 7 states and 131 transitions. [2024-06-27 23:09:23,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 189 transitions, 2313 flow [2024-06-27 23:09:24,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 189 transitions, 2134 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 23:09:24,030 INFO L231 Difference]: Finished difference. Result has 113 places, 171 transitions, 1734 flow [2024-06-27 23:09:24,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1734, PETRI_PLACES=113, PETRI_TRANSITIONS=171} [2024-06-27 23:09:24,031 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-27 23:09:24,031 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 171 transitions, 1734 flow [2024-06-27 23:09:24,031 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-27 23:09:24,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:24,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:24,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:09:24,032 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-27 23:09:24,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1404380537, now seen corresponding path program 3 times [2024-06-27 23:09:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407394460] [2024-06-27 23:09:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:25,373 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-27 23:09:25,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407394460] [2024-06-27 23:09:25,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407394460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:25,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:25,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344470111] [2024-06-27 23:09:25,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:25,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:25,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:25,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:25,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 171 transitions, 1734 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-27 23:09:25,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:25,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:25,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:26,108 INFO L124 PetriNetUnfolderBase]: 1927/2982 cut-off events. [2024-06-27 23:09:26,108 INFO L125 PetriNetUnfolderBase]: For 45700/45700 co-relation queries the response was YES. [2024-06-27 23:09:26,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15681 conditions, 2982 events. 1927/2982 cut-off events. For 45700/45700 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14947 event pairs, 888 based on Foata normal form. 5/2976 useless extension candidates. Maximal degree in co-relation 15630. Up to 2765 conditions per place. [2024-06-27 23:09:26,126 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 168 selfloop transitions, 32 changer transitions 0/205 dead transitions. [2024-06-27 23:09:26,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 205 transitions, 2437 flow [2024-06-27 23:09:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:09:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:09:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 23:09:26,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-27 23:09:26,127 INFO L175 Difference]: Start difference. First operand has 113 places, 171 transitions, 1734 flow. Second operand 8 states and 147 transitions. [2024-06-27 23:09:26,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 205 transitions, 2437 flow [2024-06-27 23:09:26,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 205 transitions, 2344 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 23:09:26,192 INFO L231 Difference]: Finished difference. Result has 115 places, 178 transitions, 1818 flow [2024-06-27 23:09:26,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1818, PETRI_PLACES=115, PETRI_TRANSITIONS=178} [2024-06-27 23:09:26,192 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-27 23:09:26,193 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 178 transitions, 1818 flow [2024-06-27 23:09:26,193 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-27 23:09:26,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:26,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:26,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:09:26,193 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-27 23:09:26,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1173789841, now seen corresponding path program 4 times [2024-06-27 23:09:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:26,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844100864] [2024-06-27 23:09:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:27,469 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-27 23:09:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844100864] [2024-06-27 23:09:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844100864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:27,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:27,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562712920] [2024-06-27 23:09:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:27,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:27,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:27,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:27,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 178 transitions, 1818 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-27 23:09:27,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:27,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:27,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:28,174 INFO L124 PetriNetUnfolderBase]: 1914/2964 cut-off events. [2024-06-27 23:09:28,175 INFO L125 PetriNetUnfolderBase]: For 48825/48825 co-relation queries the response was YES. [2024-06-27 23:09:28,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15739 conditions, 2964 events. 1914/2964 cut-off events. For 48825/48825 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14875 event pairs, 886 based on Foata normal form. 5/2958 useless extension candidates. Maximal degree in co-relation 15687. Up to 2792 conditions per place. [2024-06-27 23:09:28,190 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 174 selfloop transitions, 20 changer transitions 0/199 dead transitions. [2024-06-27 23:09:28,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 199 transitions, 2308 flow [2024-06-27 23:09:28,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:09:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:09:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 23:09:28,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-27 23:09:28,192 INFO L175 Difference]: Start difference. First operand has 115 places, 178 transitions, 1818 flow. Second operand 7 states and 132 transitions. [2024-06-27 23:09:28,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 199 transitions, 2308 flow [2024-06-27 23:09:28,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 199 transitions, 2122 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:28,244 INFO L231 Difference]: Finished difference. Result has 115 places, 178 transitions, 1684 flow [2024-06-27 23:09:28,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1684, PETRI_PLACES=115, PETRI_TRANSITIONS=178} [2024-06-27 23:09:28,245 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-27 23:09:28,245 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 178 transitions, 1684 flow [2024-06-27 23:09:28,245 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-27 23:09:28,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:28,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:28,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:09:28,246 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:09:28,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:28,246 INFO L85 PathProgramCache]: Analyzing trace with hash 875095549, now seen corresponding path program 1 times [2024-06-27 23:09:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:28,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349417726] [2024-06-27 23:09:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:28,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:29,880 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-27 23:09:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349417726] [2024-06-27 23:09:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349417726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:09:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725043293] [2024-06-27 23:09:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:09:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:09:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:09:29,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:29,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 178 transitions, 1684 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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-27 23:09:29,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:29,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:29,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:30,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([381] L782-->L785: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~y~0=v_~y~0_1, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0][38], [Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 123#(and (= ~__unbuffered_p0_EAX~0 0) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), 42#$Ultimate##0true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 104#true, 283#true, Black: 134#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 261#(and (or (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 0) (= ~z$w_buff0_used~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$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 7#L762true, Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 275#(and (or (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 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 22#L785true, Black: 220#(and (= ~z$w_buff1_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (or (= ~__unbuffered_p0_EAX~0 0) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 223#true, Black: 216#(and (= ~z$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, 16#L851true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (or (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 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 269#true, Black: 166#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 239#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 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) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 175#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__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$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 177#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 249#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 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) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 124#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 189#(and (= ~__unbuffered_cnt~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1))]) [2024-06-27 23:09:30,310 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-06-27 23:09:30,310 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:09:30,310 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:09:30,310 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 23:09:30,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L800-->L802: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0][174], [Black: 123#(and (= ~__unbuffered_p0_EAX~0 0) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 104#true, 283#true, Black: 134#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 261#(and (or (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 0) (= ~z$w_buff0_used~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$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), 7#L762true, Black: 275#(and (or (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 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 220#(and (= ~z$w_buff1_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (or (= ~__unbuffered_p0_EAX~0 0) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 223#true, Black: 154#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 216#(and (= ~z$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), 16#L851true, Black: 229#(and (or (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 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 269#true, Black: 166#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 38#L802true, P1Thread1of1ForFork2InUse, Black: 239#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 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) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), 140#true, P0Thread1of1ForFork0InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P2Thread1of1ForFork1InUse, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 175#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__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$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 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) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), Black: 177#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 124#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 189#(and (= ~__unbuffered_cnt~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1))]) [2024-06-27 23:09:30,328 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-06-27 23:09:30,328 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:09:30,328 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:09:30,328 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-06-27 23:09:30,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([375] L762-->L769: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd1~0_26 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_57 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_58 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_47 256) 0)) .cse4))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_47) v_~z$w_buff1_used~0_46) (= v_~z$w_buff0_used~0_57 (ite .cse2 0 v_~z$w_buff0_used~0_58)) (= v_~z$r_buff0_thd1~0_30 (ite .cse0 0 v_~z$r_buff0_thd1~0_31)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_46 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_26) v_~z$r_buff1_thd1~0_25) (= v_~z~0_22 (ite .cse2 v_~z$w_buff0~0_21 (ite .cse1 v_~z$w_buff1~0_18 v_~z~0_23)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_58, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_47, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_57, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_46, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][91], [Black: 123#(and (= ~__unbuffered_p0_EAX~0 0) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 42#$Ultimate##0true, 20#L769true, 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 283#true, 104#true, Black: 134#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 261#(and (or (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 0) (= ~z$w_buff0_used~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$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 275#(and (or (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 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 220#(and (= ~z$w_buff1_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (or (= ~__unbuffered_p0_EAX~0 0) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 223#true, Black: 216#(and (= ~z$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, 16#L851true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (or (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 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 269#true, Black: 166#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, Black: 239#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 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) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), P0Thread1of1ForFork0InUse, 140#true, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P2Thread1of1ForFork1InUse, Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 175#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__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$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 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) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), Black: 177#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 124#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 189#(and (= ~__unbuffered_cnt~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 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-27 23:09:30,329 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-27 23:09:30,330 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:09:30,330 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:09:30,330 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:09:30,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([349] L851-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (and (let ((.cse5 (mod v_~z$w_buff0_used~0_35 256))) (let ((.cse2 (mod v_~z$r_buff1_thd2~0_11 256)) (.cse6 (+ .cse5 1)) (.cse3 (mod v_~z$r_buff1_thd3~0_19 256)) (.cse12 (mod v_~z$r_buff0_thd3~0_21 256)) (.cse10 (mod v_~z$w_buff1_used~0_28 256)) (.cse11 (mod v_~z$r_buff1_thd1~0_11 256)) (.cse7 (mod v_~z$r_buff0_thd2~0_13 256)) (.cse8 (mod v_~z$r_buff1_thd0~0_7 256)) (.cse0 (mod v_~z$r_buff0_thd0~0_7 256)) (.cse4 (mod v_~z$flush_delayed~0_9 256)) (.cse1 (mod v_~z$r_buff0_thd1~0_14 256)) (.cse9 (mod v_~z$read_delayed~0_6 256))) (or (< v_~z$w_buff0~0_14 .cse0) (< v_~y~0_9 v_~__unbuffered_p1_EBX~0_7) (< .cse1 .cse2) (< (+ .cse3 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 .cse4) (< (+ .cse5 v_~x~0_9) 0) (< v_~z$w_buff0~0_14 .cse2) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse1) 0) (< (+ .cse1 v_~__unbuffered_p1_EBX~0_7) 0) (< v_~z$w_buff0~0_14 .cse3) (< (+ .cse2 v_~z$w_buff0~0_14) 0) (< .cse1 v_~z$w_buff0~0_14) (< (+ v_~__unbuffered_p1_EAX~0_7 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 v_~z$w_buff1~0_13) (< .cse5 .cse0) (< .cse6 v_~z$w_buff1~0_13) (< v_~z$w_buff0~0_14 .cse1) (< (+ v_~z$w_buff0~0_14 v_~x~0_9) 0) (< .cse1 .cse7) (< v_~z$mem_tmp~0_8 v_~__unbuffered_p2_EBX~0_7) (< .cse1 .cse8) (< (+ .cse1 v_~z$mem_tmp~0_8) 0) (< (+ .cse9 v_~z$w_buff0~0_14) 0) (< v_~z~0_18 v_~__unbuffered_p2_EBX~0_7) (< (+ (mod v_~main$tmp_guard1~0_6 256) v_~z$w_buff0~0_14) 0) (< v_~z~0_18 v_~z$mem_tmp~0_8) (< (+ .cse10 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 .cse8) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse5) 0) (< .cse5 .cse3) (< (+ v_~z$w_buff0~0_14 .cse7) 0) (< v_~z$w_buff1~0_13 .cse11) (< .cse11 v_~z$w_buff1~0_13) (< (+ .cse1 v_~__unbuffered_cnt~0_12) 0) (< .cse5 .cse12) (< (+ .cse4 v_~z$w_buff0~0_14) 0) (< (+ v_~z$w_buff0~0_14 v_~y~0_9) 0) (< (+ .cse1 v_~__unbuffered_p1_EAX~0_7) 0) (< (+ .cse5 v_~__unbuffered_p1_EBX~0_7) 0) (< .cse11 .cse10) (< .cse1 .cse10) (< (+ v_~__unbuffered_p0_EAX~0_7 v_~z$w_buff0~0_14) 0) (< .cse1 .cse4) (< v_~z$w_buff0~0_14 .cse5) (< (+ (mod v_~weak$$choice0~0_7 256) v_~z$w_buff0~0_14) 0) (< (+ .cse5 v_~z$w_buff0~0_14) 0) (< .cse1 .cse11) (< .cse6 v_~z$w_buff0~0_14) (< (+ v_~z~0_18 v_~z$w_buff0~0_14) 0) (< (+ .cse1 v_~y~0_9) 0) (< (+ .cse5 v_~z$mem_tmp~0_8) 0) (< (+ v_~__unbuffered_p0_EAX~0_7 .cse5) 0) (< (+ v_~z$w_buff0~0_14 v_~z$mem_tmp~0_8) 0) (< .cse6 .cse11) (< (+ v_~z~0_18 .cse5) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse1) 0) (< (+ .cse1 v_~z$w_buff1~0_13) 0) (< v_~y~0_9 v_~__unbuffered_p2_EAX~0_7) (< v_~z$w_buff0~0_14 .cse11) (< .cse5 .cse2) (< .cse6 .cse1) (< (+ v_~__unbuffered_cnt~0_12 v_~z$w_buff0~0_14) 0) (< (+ v_~z~0_18 .cse1) 0) (< .cse5 .cse7) (< (+ .cse1 v_~x~0_9) 0) (< v_~z$w_buff0~0_14 .cse10) (< .cse1 .cse5) (< v_~x~0_9 v_~__unbuffered_p1_EAX~0_7) (< .cse1 .cse3) (< (+ v_~z$w_buff0~0_14 v_~z$w_buff1~0_13) 0) (< (+ .cse5 v_~__unbuffered_p1_EAX~0_7) 0) (< v_~z$w_buff1~0_13 .cse10) (< (+ .cse12 v_~z$w_buff0~0_14) 0) (< (+ .cse5 v_~__unbuffered_cnt~0_12) 0) (< (+ .cse5 v_~z$w_buff1~0_13) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse1) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$w_buff0~0_14) 0) (< (+ .cse1 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 .cse12) (< .cse1 .cse12) (< v_~x~0_9 v_~__unbuffered_p0_EAX~0_7) (< .cse5 .cse10) (< (+ .cse5 v_~y~0_9) 0) (< (+ v_~__unbuffered_p2_EBX~0_7 .cse5) 0) (< .cse5 .cse8) (< (+ v_~z$w_buff0~0_14 .cse11) 0) (< v_~__unbuffered_p2_EBX~0_7 v_~z$mem_tmp~0_8) (< (+ .cse0 v_~z$w_buff0~0_14) 0) (< v_~z$w_buff0~0_14 .cse7) (< (+ .cse8 v_~z$w_buff0~0_14) 0) (< .cse1 .cse0) (< (+ v_~__unbuffered_p2_EBX~0_7 v_~z$w_buff0~0_14) 0) (< (+ v_~__unbuffered_p1_EBX~0_7 v_~z$w_buff0~0_14) 0) (< (+ (mod v_~weak$$choice2~0_14 256) v_~z$w_buff0~0_14) 0) (< .cse1 .cse9) (< v_~z$w_buff0~0_14 .cse9) (< .cse5 .cse4) (< .cse1 v_~z$w_buff1~0_13) (< .cse5 .cse9)))) (not (= |v_#ghost~multithreaded_7| 0))) 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_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~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_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_35, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_28, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_14, ~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_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~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_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$w_buff0~0=v_~z$w_buff0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_35, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_28, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_14, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[][151], [Black: 123#(and (= ~__unbuffered_p0_EAX~0 0) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 178#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 42#$Ultimate##0true, 2#L782true, Black: 69#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= ~z$r_buff0_thd3~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~z$r_buff0_thd3~0 256)) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (<= ~z$w_buff0_used~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 283#true, 104#true, Black: 134#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 261#(and (or (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 0) (= ~z$w_buff0_used~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$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0)), Black: 78#(and (= 0 ~z$flush_delayed~0) (= ~z~0 1) (= ~x~0 0) (<= 0 (div ~z$w_buff1_used~0 256)) (<= 0 (div ~z$w_buff0_used~0 256)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (not (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0)) (<= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (<= 0 (div ~z$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EBX~0 0) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~__unbuffered_p2_EBX~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= ~z$w_buff1_used~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 207#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 196#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 7#L762true, Black: 86#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (or (and (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 275#(and (or (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 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 82#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 154#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 220#(and (= ~z$w_buff1_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (or (= ~__unbuffered_p0_EAX~0 0) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 223#true, Black: 216#(and (= ~z$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 193#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$r_buff0_thd1~0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$flush_delayed~0) (+ (* (div ~z$flush_delayed~0 256) 256) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd1~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 229#(and (or (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 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0)) (= ~z$w_buff0~0 1)), 269#true, Black: 166#(or (and (= ~__unbuffered_cnt~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (= ~__unbuffered_p2_EAX~0 0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256)))) (= ~z$w_buff0~0 1)) (= |#ghost~multithreaded| 0)), Black: 163#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), P1Thread1of1ForFork2InUse, 34#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 239#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 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) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 115#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), Black: 107#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1)), 175#true, Black: 57#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (<= ~z$r_buff1_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (<= 0 (div ~z$r_buff1_thd0~0 256)) (= ~__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$r_buff1_thd1~0 0) (= ~z$r_buff0_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd2~0 0)), Black: 249#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd1~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff1~0 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) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0))) (= ~z$w_buff0~0 1)), Black: 177#(and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~z$w_buff0~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 62#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$w_buff1_used~0 0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~z$r_buff0_thd1~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~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$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 124#(and (= ~__unbuffered_p0_EAX~0 0) (= ~x~0 1) (= ~z$w_buff0~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (<= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~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) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (<= 0 (div ~z$r_buff1_thd3~0 256)) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~z$r_buff1_thd1~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)) (= |#ghost~multithreaded| 0))), Black: 189#(and (= ~__unbuffered_cnt~0 0) (or (and (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$flush_delayed~0) (+ ~z$w_buff0_used~0 (* (div ~z$flush_delayed~0 256) 256))) (= ~__unbuffered_p1_EAX~0 1) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$read_delayed~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$read_delayed~0 256)))) (= (+ (* 256 (div ~z$r_buff0_thd1~0 256)) 1) ~z$r_buff0_thd1~0) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd2~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff0_thd2~0 256) 256))) (= ~z$r_buff1_thd1~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd0~0) (+ ~z$w_buff0_used~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd2~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~x~0 1) (<= (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd1~0 256))) (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd1~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$w_buff0_used~0)) (<= (+ (* 256 (div ~z$w_buff0_used~0 256)) ~z$r_buff1_thd3~0) (+ ~z$w_buff0_used~0 (* 256 (div ~z$r_buff1_thd3~0 256)))) (<= (+ ~z$w_buff1_used~0 (* (div ~z$r_buff1_thd1~0 256) 256)) (+ ~z$r_buff1_thd1~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= |#ghost~multithreaded| 0)) (= ~z$w_buff1~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~__unbuffered_p2_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$w_buff0~0 1))]) [2024-06-27 23:09:30,331 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2024-06-27 23:09:30,331 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:09:30,331 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:09:30,331 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2024-06-27 23:09:30,648 INFO L124 PetriNetUnfolderBase]: 2304/3534 cut-off events. [2024-06-27 23:09:30,648 INFO L125 PetriNetUnfolderBase]: For 73534/73628 co-relation queries the response was YES. [2024-06-27 23:09:30,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18924 conditions, 3534 events. 2304/3534 cut-off events. For 73534/73628 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18085 event pairs, 1211 based on Foata normal form. 14/3500 useless extension candidates. Maximal degree in co-relation 18873. Up to 3305 conditions per place. [2024-06-27 23:09:30,668 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 131 selfloop transitions, 10 changer transitions 0/188 dead transitions. [2024-06-27 23:09:30,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 188 transitions, 2014 flow [2024-06-27 23:09:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:09:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:09:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-27 23:09:30,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-27 23:09:30,669 INFO L175 Difference]: Start difference. First operand has 115 places, 178 transitions, 1684 flow. Second operand 5 states and 93 transitions. [2024-06-27 23:09:30,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 188 transitions, 2014 flow [2024-06-27 23:09:30,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 188 transitions, 1907 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 23:09:30,726 INFO L231 Difference]: Finished difference. Result has 114 places, 181 transitions, 1629 flow [2024-06-27 23:09:30,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1629, PETRI_PLACES=114, PETRI_TRANSITIONS=181} [2024-06-27 23:09:30,727 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-27 23:09:30,727 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 181 transitions, 1629 flow [2024-06-27 23:09:30,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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-27 23:09:30,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:30,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:30,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:09:30,728 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-27 23:09:30,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash -613709933, now seen corresponding path program 1 times [2024-06-27 23:09:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:30,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761152066] [2024-06-27 23:09:30,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:32,503 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-27 23:09:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761152066] [2024-06-27 23:09:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761152066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:32,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:32,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657452098] [2024-06-27 23:09:32,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:32,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:32,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:09:32,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 181 transitions, 1629 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:09:32,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:32,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:09:32,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:33,449 INFO L124 PetriNetUnfolderBase]: 2425/3661 cut-off events. [2024-06-27 23:09:33,450 INFO L125 PetriNetUnfolderBase]: For 77241/77265 co-relation queries the response was YES. [2024-06-27 23:09:33,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20163 conditions, 3661 events. 2425/3661 cut-off events. For 77241/77265 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18042 event pairs, 1135 based on Foata normal form. 2/3627 useless extension candidates. Maximal degree in co-relation 20111. Up to 3461 conditions per place. [2024-06-27 23:09:33,473 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 163 selfloop transitions, 37 changer transitions 0/205 dead transitions. [2024-06-27 23:09:33,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 205 transitions, 2137 flow [2024-06-27 23:09:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:09:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:09:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 23:09:33,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-27 23:09:33,475 INFO L175 Difference]: Start difference. First operand has 114 places, 181 transitions, 1629 flow. Second operand 8 states and 143 transitions. [2024-06-27 23:09:33,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 205 transitions, 2137 flow [2024-06-27 23:09:33,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 205 transitions, 2107 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 23:09:33,540 INFO L231 Difference]: Finished difference. Result has 119 places, 184 transitions, 1720 flow [2024-06-27 23:09:33,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1720, PETRI_PLACES=119, PETRI_TRANSITIONS=184} [2024-06-27 23:09:33,541 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2024-06-27 23:09:33,541 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 184 transitions, 1720 flow [2024-06-27 23:09:33,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:09:33,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:33,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:33,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:09:33,542 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-27 23:09:33,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash -536907536, now seen corresponding path program 1 times [2024-06-27 23:09:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741514826] [2024-06-27 23:09:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:35,153 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-27 23:09:35,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:35,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741514826] [2024-06-27 23:09:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741514826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:35,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:09:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596749754] [2024-06-27 23:09:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:35,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:09:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:35,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:09:35,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:09:35,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:35,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 184 transitions, 1720 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-27 23:09:35,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:35,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:35,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:36,196 INFO L124 PetriNetUnfolderBase]: 2287/3484 cut-off events. [2024-06-27 23:09:36,196 INFO L125 PetriNetUnfolderBase]: For 86359/86389 co-relation queries the response was YES. [2024-06-27 23:09:36,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20687 conditions, 3484 events. 2287/3484 cut-off events. For 86359/86389 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17625 event pairs, 910 based on Foata normal form. 8/3404 useless extension candidates. Maximal degree in co-relation 20634. Up to 3096 conditions per place. [2024-06-27 23:09:36,219 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 151 selfloop transitions, 75 changer transitions 0/233 dead transitions. [2024-06-27 23:09:36,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 233 transitions, 2580 flow [2024-06-27 23:09:36,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:09:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:09:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-27 23:09:36,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 23:09:36,221 INFO L175 Difference]: Start difference. First operand has 119 places, 184 transitions, 1720 flow. Second operand 10 states and 194 transitions. [2024-06-27 23:09:36,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 233 transitions, 2580 flow [2024-06-27 23:09:36,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 233 transitions, 2489 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 23:09:36,287 INFO L231 Difference]: Finished difference. Result has 125 places, 199 transitions, 2007 flow [2024-06-27 23:09:36,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2007, PETRI_PLACES=125, PETRI_TRANSITIONS=199} [2024-06-27 23:09:36,287 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-27 23:09:36,287 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 199 transitions, 2007 flow [2024-06-27 23:09:36,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-27 23:09:36,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:36,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:36,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 23:09:36,288 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-27 23:09:36,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1650561126, now seen corresponding path program 2 times [2024-06-27 23:09:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:36,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470839831] [2024-06-27 23:09:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:38,653 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-27 23:09:38,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:38,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470839831] [2024-06-27 23:09:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470839831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:38,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:38,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781686532] [2024-06-27 23:09:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:38,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:38,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:09:38,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 199 transitions, 2007 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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-27 23:09:38,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:38,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:09:38,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:39,670 INFO L124 PetriNetUnfolderBase]: 2305/3511 cut-off events. [2024-06-27 23:09:39,670 INFO L125 PetriNetUnfolderBase]: For 96650/96680 co-relation queries the response was YES. [2024-06-27 23:09:39,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21874 conditions, 3511 events. 2305/3511 cut-off events. For 96650/96680 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17740 event pairs, 910 based on Foata normal form. 9/3432 useless extension candidates. Maximal degree in co-relation 21818. Up to 3116 conditions per place. [2024-06-27 23:09:39,688 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 153 selfloop transitions, 80 changer transitions 0/240 dead transitions. [2024-06-27 23:09:39,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 240 transitions, 2833 flow [2024-06-27 23:09:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-27 23:09:39,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2024-06-27 23:09:39,690 INFO L175 Difference]: Start difference. First operand has 125 places, 199 transitions, 2007 flow. Second operand 9 states and 185 transitions. [2024-06-27 23:09:39,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 240 transitions, 2833 flow [2024-06-27 23:09:39,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 240 transitions, 2714 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-27 23:09:39,766 INFO L231 Difference]: Finished difference. Result has 130 places, 205 transitions, 2160 flow [2024-06-27 23:09:39,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2160, PETRI_PLACES=130, PETRI_TRANSITIONS=205} [2024-06-27 23:09:39,766 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places. [2024-06-27 23:09:39,766 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 205 transitions, 2160 flow [2024-06-27 23:09:39,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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-27 23:09:39,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:39,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:39,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 23:09:39,767 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-27 23:09:39,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1639358191, now seen corresponding path program 2 times [2024-06-27 23:09:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946311852] [2024-06-27 23:09:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:41,585 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-27 23:09:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946311852] [2024-06-27 23:09:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946311852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:41,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556636333] [2024-06-27 23:09:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:41,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:41,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:41,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 205 transitions, 2160 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-27 23:09:41,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:41,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:41,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:42,779 INFO L124 PetriNetUnfolderBase]: 2335/3590 cut-off events. [2024-06-27 23:09:42,779 INFO L125 PetriNetUnfolderBase]: For 96858/96884 co-relation queries the response was YES. [2024-06-27 23:09:42,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22275 conditions, 3590 events. 2335/3590 cut-off events. For 96858/96884 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18281 event pairs, 882 based on Foata normal form. 6/3532 useless extension candidates. Maximal degree in co-relation 22218. Up to 3208 conditions per place. [2024-06-27 23:09:42,802 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 175 selfloop transitions, 75 changer transitions 0/257 dead transitions. [2024-06-27 23:09:42,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 257 transitions, 3106 flow [2024-06-27 23:09:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:09:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:09:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2024-06-27 23:09:42,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45021645021645024 [2024-06-27 23:09:42,803 INFO L175 Difference]: Start difference. First operand has 130 places, 205 transitions, 2160 flow. Second operand 11 states and 208 transitions. [2024-06-27 23:09:42,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 257 transitions, 3106 flow [2024-06-27 23:09:42,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 257 transitions, 2928 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 23:09:42,894 INFO L231 Difference]: Finished difference. Result has 136 places, 219 transitions, 2315 flow [2024-06-27 23:09:42,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1982, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2315, PETRI_PLACES=136, PETRI_TRANSITIONS=219} [2024-06-27 23:09:42,894 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places. [2024-06-27 23:09:42,894 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 219 transitions, 2315 flow [2024-06-27 23:09:42,895 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-27 23:09:42,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:42,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:42,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 23:09:42,895 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-27 23:09:42,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1639362996, now seen corresponding path program 3 times [2024-06-27 23:09:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007546877] [2024-06-27 23:09:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:45,197 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-27 23:09:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007546877] [2024-06-27 23:09:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007546877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:45,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125091412] [2024-06-27 23:09:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:45,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:45,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:09:45,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 219 transitions, 2315 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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-27 23:09:45,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:45,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:09:45,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:46,205 INFO L124 PetriNetUnfolderBase]: 2342/3583 cut-off events. [2024-06-27 23:09:46,205 INFO L125 PetriNetUnfolderBase]: For 104982/105003 co-relation queries the response was YES. [2024-06-27 23:09:46,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23104 conditions, 3583 events. 2342/3583 cut-off events. For 104982/105003 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18179 event pairs, 904 based on Foata normal form. 5/3498 useless extension candidates. Maximal degree in co-relation 23045. Up to 3226 conditions per place. [2024-06-27 23:09:46,226 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 173 selfloop transitions, 65 changer transitions 0/245 dead transitions. [2024-06-27 23:09:46,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 245 transitions, 2930 flow [2024-06-27 23:09:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:09:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:09:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-27 23:09:46,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-27 23:09:46,228 INFO L175 Difference]: Start difference. First operand has 136 places, 219 transitions, 2315 flow. Second operand 8 states and 161 transitions. [2024-06-27 23:09:46,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 245 transitions, 2930 flow [2024-06-27 23:09:46,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 245 transitions, 2782 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-27 23:09:46,332 INFO L231 Difference]: Finished difference. Result has 138 places, 219 transitions, 2315 flow [2024-06-27 23:09:46,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2315, PETRI_PLACES=138, PETRI_TRANSITIONS=219} [2024-06-27 23:09:46,333 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2024-06-27 23:09:46,333 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 219 transitions, 2315 flow [2024-06-27 23:09:46,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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-27 23:09:46,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:46,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:46,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 23:09:46,334 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-27 23:09:46,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:46,334 INFO L85 PathProgramCache]: Analyzing trace with hash -61007319, now seen corresponding path program 3 times [2024-06-27 23:09:46,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:46,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805609325] [2024-06-27 23:09:46,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:46,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:48,430 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-27 23:09:48,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805609325] [2024-06-27 23:09:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805609325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:48,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405436530] [2024-06-27 23:09:48,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:48,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:48,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:48,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:48,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 219 transitions, 2315 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-27 23:09:48,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:48,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:48,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:49,572 INFO L124 PetriNetUnfolderBase]: 2346/3602 cut-off events. [2024-06-27 23:09:49,572 INFO L125 PetriNetUnfolderBase]: For 111239/111257 co-relation queries the response was YES. [2024-06-27 23:09:49,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23261 conditions, 3602 events. 2346/3602 cut-off events. For 111239/111257 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18219 event pairs, 847 based on Foata normal form. 11/3554 useless extension candidates. Maximal degree in co-relation 23200. Up to 3271 conditions per place. [2024-06-27 23:09:49,596 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 190 selfloop transitions, 60 changer transitions 0/257 dead transitions. [2024-06-27 23:09:49,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 257 transitions, 3038 flow [2024-06-27 23:09:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 23:09:49,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:09:49,598 INFO L175 Difference]: Start difference. First operand has 138 places, 219 transitions, 2315 flow. Second operand 9 states and 171 transitions. [2024-06-27 23:09:49,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 257 transitions, 3038 flow [2024-06-27 23:09:49,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 257 transitions, 2895 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:49,686 INFO L231 Difference]: Finished difference. Result has 140 places, 230 transitions, 2441 flow [2024-06-27 23:09:49,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2172, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2441, PETRI_PLACES=140, PETRI_TRANSITIONS=230} [2024-06-27 23:09:49,687 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-06-27 23:09:49,687 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 230 transitions, 2441 flow [2024-06-27 23:09:49,687 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-27 23:09:49,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:49,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:49,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 23:09:49,688 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-27 23:09:49,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:49,688 INFO L85 PathProgramCache]: Analyzing trace with hash 275184891, now seen corresponding path program 4 times [2024-06-27 23:09:49,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:49,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127543631] [2024-06-27 23:09:49,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:51,901 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-27 23:09:51,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:51,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127543631] [2024-06-27 23:09:51,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127543631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:51,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:51,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692819647] [2024-06-27 23:09:51,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:51,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:51,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:52,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:52,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 230 transitions, 2441 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-27 23:09:52,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:52,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:52,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:53,029 INFO L124 PetriNetUnfolderBase]: 2440/3729 cut-off events. [2024-06-27 23:09:53,029 INFO L125 PetriNetUnfolderBase]: For 125740/125762 co-relation queries the response was YES. [2024-06-27 23:09:53,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24702 conditions, 3729 events. 2440/3729 cut-off events. For 125740/125762 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18940 event pairs, 870 based on Foata normal form. 6/3660 useless extension candidates. Maximal degree in co-relation 24640. Up to 3106 conditions per place. [2024-06-27 23:09:53,127 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 132 selfloop transitions, 138 changer transitions 0/277 dead transitions. [2024-06-27 23:09:53,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 277 transitions, 3596 flow [2024-06-27 23:09:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:09:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:09:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-27 23:09:53,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-27 23:09:53,129 INFO L175 Difference]: Start difference. First operand has 140 places, 230 transitions, 2441 flow. Second operand 9 states and 183 transitions. [2024-06-27 23:09:53,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 277 transitions, 3596 flow [2024-06-27 23:09:53,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 277 transitions, 3451 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 23:09:53,242 INFO L231 Difference]: Finished difference. Result has 143 places, 244 transitions, 2834 flow [2024-06-27 23:09:53,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2834, PETRI_PLACES=143, PETRI_TRANSITIONS=244} [2024-06-27 23:09:53,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2024-06-27 23:09:53,243 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 244 transitions, 2834 flow [2024-06-27 23:09:53,243 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-27 23:09:53,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:53,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:53,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 23:09:53,243 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-27 23:09:53,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1063109600, now seen corresponding path program 4 times [2024-06-27 23:09:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947088121] [2024-06-27 23:09:53,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:55,646 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-27 23:09:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947088121] [2024-06-27 23:09:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947088121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:55,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:55,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759012734] [2024-06-27 23:09:55,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:55,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:55,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:09:55,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 244 transitions, 2834 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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-27 23:09:55,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:55,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:09:55,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:09:56,733 INFO L124 PetriNetUnfolderBase]: 2428/3728 cut-off events. [2024-06-27 23:09:56,733 INFO L125 PetriNetUnfolderBase]: For 133633/133651 co-relation queries the response was YES. [2024-06-27 23:09:56,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25608 conditions, 3728 events. 2428/3728 cut-off events. For 133633/133651 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18965 event pairs, 860 based on Foata normal form. 8/3677 useless extension candidates. Maximal degree in co-relation 25544. Up to 3272 conditions per place. [2024-06-27 23:09:56,755 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 172 selfloop transitions, 94 changer transitions 0/273 dead transitions. [2024-06-27 23:09:56,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 273 transitions, 3596 flow [2024-06-27 23:09:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:09:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:09:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-27 23:09:56,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-27 23:09:56,757 INFO L175 Difference]: Start difference. First operand has 143 places, 244 transitions, 2834 flow. Second operand 8 states and 162 transitions. [2024-06-27 23:09:56,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 273 transitions, 3596 flow [2024-06-27 23:09:56,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 273 transitions, 3488 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-27 23:09:56,859 INFO L231 Difference]: Finished difference. Result has 148 places, 247 transitions, 2987 flow [2024-06-27 23:09:56,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2738, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2987, PETRI_PLACES=148, PETRI_TRANSITIONS=247} [2024-06-27 23:09:56,860 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places. [2024-06-27 23:09:56,860 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 247 transitions, 2987 flow [2024-06-27 23:09:56,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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-27 23:09:56,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:09:56,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:09:56,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 23:09:56,861 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-27 23:09:56,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:09:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash 275179311, now seen corresponding path program 5 times [2024-06-27 23:09:56,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:09:56,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241141393] [2024-06-27 23:09:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:09:56,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:09:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:09:58,943 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-27 23:09:58,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:09:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241141393] [2024-06-27 23:09:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241141393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:09:58,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:09:58,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:09:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730717651] [2024-06-27 23:09:58,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:09:58,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:09:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:09:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:09:58,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:09:59,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:09:59,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 247 transitions, 2987 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-27 23:09:59,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:09:59,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:09:59,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:00,206 INFO L124 PetriNetUnfolderBase]: 2441/3731 cut-off events. [2024-06-27 23:10:00,206 INFO L125 PetriNetUnfolderBase]: For 144471/144499 co-relation queries the response was YES. [2024-06-27 23:10:00,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26197 conditions, 3731 events. 2441/3731 cut-off events. For 144471/144499 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18984 event pairs, 868 based on Foata normal form. 8/3664 useless extension candidates. Maximal degree in co-relation 26131. Up to 3114 conditions per place. [2024-06-27 23:10:00,232 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 139 selfloop transitions, 132 changer transitions 0/278 dead transitions. [2024-06-27 23:10:00,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 278 transitions, 3849 flow [2024-06-27 23:10:00,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-27 23:10:00,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-06-27 23:10:00,234 INFO L175 Difference]: Start difference. First operand has 148 places, 247 transitions, 2987 flow. Second operand 9 states and 182 transitions. [2024-06-27 23:10:00,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 278 transitions, 3849 flow [2024-06-27 23:10:00,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 278 transitions, 3616 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 23:10:00,404 INFO L231 Difference]: Finished difference. Result has 151 places, 247 transitions, 3027 flow [2024-06-27 23:10:00,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2754, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3027, PETRI_PLACES=151, PETRI_TRANSITIONS=247} [2024-06-27 23:10:00,405 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places. [2024-06-27 23:10:00,405 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 247 transitions, 3027 flow [2024-06-27 23:10:00,405 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-27 23:10:00,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:00,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:00,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 23:10:00,405 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-27 23:10:00,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash -609990863, now seen corresponding path program 6 times [2024-06-27 23:10:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613625948] [2024-06-27 23:10:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:01,909 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-27 23:10:01,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:01,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613625948] [2024-06-27 23:10:01,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613625948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:01,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:01,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:10:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754435456] [2024-06-27 23:10:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:01,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:10:01,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:10:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:10:02,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:10:02,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 247 transitions, 3027 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:02,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:02,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:10:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:02,837 INFO L124 PetriNetUnfolderBase]: 2780/4193 cut-off events. [2024-06-27 23:10:02,837 INFO L125 PetriNetUnfolderBase]: For 157472/157497 co-relation queries the response was YES. [2024-06-27 23:10:02,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28984 conditions, 4193 events. 2780/4193 cut-off events. For 157472/157497 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20924 event pairs, 1124 based on Foata normal form. 3/4162 useless extension candidates. Maximal degree in co-relation 28917. Up to 3735 conditions per place. [2024-06-27 23:10:02,868 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 216 selfloop transitions, 96 changer transitions 0/317 dead transitions. [2024-06-27 23:10:02,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 317 transitions, 4619 flow [2024-06-27 23:10:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 23:10:02,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-27 23:10:02,870 INFO L175 Difference]: Start difference. First operand has 151 places, 247 transitions, 3027 flow. Second operand 8 states and 156 transitions. [2024-06-27 23:10:02,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 317 transitions, 4619 flow [2024-06-27 23:10:03,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 317 transitions, 4232 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 23:10:03,071 INFO L231 Difference]: Finished difference. Result has 154 places, 282 transitions, 3499 flow [2024-06-27 23:10:03,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2722, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3499, PETRI_PLACES=154, PETRI_TRANSITIONS=282} [2024-06-27 23:10:03,071 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2024-06-27 23:10:03,072 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 282 transitions, 3499 flow [2024-06-27 23:10:03,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:03,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:03,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:03,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 23:10:03,072 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-27 23:10:03,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1210805921, now seen corresponding path program 7 times [2024-06-27 23:10:03,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:03,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031010195] [2024-06-27 23:10:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:04,764 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-27 23:10:04,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:04,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031010195] [2024-06-27 23:10:04,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031010195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:04,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:04,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:10:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819999514] [2024-06-27 23:10:04,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:04,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:10:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:04,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:10:04,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:10:04,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:10:04,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 282 transitions, 3499 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:04,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:04,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:10:04,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:05,680 INFO L124 PetriNetUnfolderBase]: 2772/4182 cut-off events. [2024-06-27 23:10:05,680 INFO L125 PetriNetUnfolderBase]: For 164896/164924 co-relation queries the response was YES. [2024-06-27 23:10:05,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29467 conditions, 4182 events. 2772/4182 cut-off events. For 164896/164924 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20860 event pairs, 1124 based on Foata normal form. 3/4151 useless extension candidates. Maximal degree in co-relation 29396. Up to 3727 conditions per place. [2024-06-27 23:10:05,713 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 210 selfloop transitions, 100 changer transitions 0/315 dead transitions. [2024-06-27 23:10:05,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 315 transitions, 4464 flow [2024-06-27 23:10:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 23:10:05,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-27 23:10:05,715 INFO L175 Difference]: Start difference. First operand has 154 places, 282 transitions, 3499 flow. Second operand 8 states and 153 transitions. [2024-06-27 23:10:05,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 315 transitions, 4464 flow [2024-06-27 23:10:05,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 315 transitions, 4319 flow, removed 71 selfloop flow, removed 1 redundant places. [2024-06-27 23:10:05,942 INFO L231 Difference]: Finished difference. Result has 161 places, 282 transitions, 3568 flow [2024-06-27 23:10:05,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3568, PETRI_PLACES=161, PETRI_TRANSITIONS=282} [2024-06-27 23:10:05,943 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places. [2024-06-27 23:10:05,943 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 282 transitions, 3568 flow [2024-06-27 23:10:05,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:05,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:05,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:05,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 23:10:05,943 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-27 23:10:05,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash 706772389, now seen corresponding path program 8 times [2024-06-27 23:10:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:05,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670399839] [2024-06-27 23:10:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:05,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:07,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-27 23:10:07,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670399839] [2024-06-27 23:10:07,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670399839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:07,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:07,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:10:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33174122] [2024-06-27 23:10:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:07,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:10:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:07,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:10:07,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:10:07,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:10:07,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 282 transitions, 3568 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:07,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:07,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:10:07,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:08,432 INFO L124 PetriNetUnfolderBase]: 2782/4195 cut-off events. [2024-06-27 23:10:08,432 INFO L125 PetriNetUnfolderBase]: For 175623/175648 co-relation queries the response was YES. [2024-06-27 23:10:08,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30072 conditions, 4195 events. 2782/4195 cut-off events. For 175623/175648 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20919 event pairs, 1144 based on Foata normal form. 6/4170 useless extension candidates. Maximal degree in co-relation 29998. Up to 3971 conditions per place. [2024-06-27 23:10:08,463 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 280 selfloop transitions, 27 changer transitions 0/312 dead transitions. [2024-06-27 23:10:08,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 312 transitions, 4452 flow [2024-06-27 23:10:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 23:10:08,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 23:10:08,465 INFO L175 Difference]: Start difference. First operand has 161 places, 282 transitions, 3568 flow. Second operand 8 states and 144 transitions. [2024-06-27 23:10:08,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 312 transitions, 4452 flow [2024-06-27 23:10:08,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 312 transitions, 4253 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 23:10:08,668 INFO L231 Difference]: Finished difference. Result has 164 places, 290 transitions, 3597 flow [2024-06-27 23:10:08,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3381, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3597, PETRI_PLACES=164, PETRI_TRANSITIONS=290} [2024-06-27 23:10:08,668 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-27 23:10:08,669 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 290 transitions, 3597 flow [2024-06-27 23:10:08,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:08,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:08,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:08,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 23:10:08,669 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:08,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash 586124541, now seen corresponding path program 9 times [2024-06-27 23:10:08,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:08,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017098468] [2024-06-27 23:10:08,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:08,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:10,238 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-27 23:10:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017098468] [2024-06-27 23:10:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017098468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:10,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:10:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849090208] [2024-06-27 23:10:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:10,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:10:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:10:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:10:10,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:10:10,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 290 transitions, 3597 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:10,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:10,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:10:10,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:11,315 INFO L124 PetriNetUnfolderBase]: 2800/4222 cut-off events. [2024-06-27 23:10:11,316 INFO L125 PetriNetUnfolderBase]: For 184365/184390 co-relation queries the response was YES. [2024-06-27 23:10:11,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30511 conditions, 4222 events. 2800/4222 cut-off events. For 184365/184390 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21072 event pairs, 1141 based on Foata normal form. 3/4194 useless extension candidates. Maximal degree in co-relation 30435. Up to 3927 conditions per place. [2024-06-27 23:10:11,349 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 272 selfloop transitions, 48 changer transitions 0/325 dead transitions. [2024-06-27 23:10:11,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 325 transitions, 4690 flow [2024-06-27 23:10:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 23:10:11,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-27 23:10:11,351 INFO L175 Difference]: Start difference. First operand has 164 places, 290 transitions, 3597 flow. Second operand 8 states and 149 transitions. [2024-06-27 23:10:11,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 325 transitions, 4690 flow [2024-06-27 23:10:11,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 325 transitions, 4593 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-27 23:10:11,559 INFO L231 Difference]: Finished difference. Result has 169 places, 297 transitions, 3754 flow [2024-06-27 23:10:11,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3500, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3754, PETRI_PLACES=169, PETRI_TRANSITIONS=297} [2024-06-27 23:10:11,560 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places. [2024-06-27 23:10:11,560 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 297 transitions, 3754 flow [2024-06-27 23:10:11,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:11,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:11,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:11,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 23:10:11,560 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-27 23:10:11,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2035103079, now seen corresponding path program 10 times [2024-06-27 23:10:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:11,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857847646] [2024-06-27 23:10:11,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:11,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:12,949 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-27 23:10:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:12,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857847646] [2024-06-27 23:10:12,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857847646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:12,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:12,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:10:12,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557374464] [2024-06-27 23:10:12,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:12,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:10:12,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:12,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:10:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:10:13,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:10:13,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 297 transitions, 3754 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:13,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:13,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:10:13,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:13,889 INFO L124 PetriNetUnfolderBase]: 2792/4211 cut-off events. [2024-06-27 23:10:13,889 INFO L125 PetriNetUnfolderBase]: For 192666/192691 co-relation queries the response was YES. [2024-06-27 23:10:13,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30713 conditions, 4211 events. 2792/4211 cut-off events. For 192666/192691 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21025 event pairs, 1141 based on Foata normal form. 3/4183 useless extension candidates. Maximal degree in co-relation 30634. Up to 3919 conditions per place. [2024-06-27 23:10:13,922 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 266 selfloop transitions, 51 changer transitions 0/322 dead transitions. [2024-06-27 23:10:13,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 322 transitions, 4566 flow [2024-06-27 23:10:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 23:10:13,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-27 23:10:13,924 INFO L175 Difference]: Start difference. First operand has 169 places, 297 transitions, 3754 flow. Second operand 8 states and 147 transitions. [2024-06-27 23:10:13,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 322 transitions, 4566 flow [2024-06-27 23:10:14,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 322 transitions, 4266 flow, removed 78 selfloop flow, removed 7 redundant places. [2024-06-27 23:10:14,190 INFO L231 Difference]: Finished difference. Result has 170 places, 298 transitions, 3579 flow [2024-06-27 23:10:14,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3460, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3579, PETRI_PLACES=170, PETRI_TRANSITIONS=298} [2024-06-27 23:10:14,191 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2024-06-27 23:10:14,191 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 298 transitions, 3579 flow [2024-06-27 23:10:14,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 23:10:14,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:14,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:14,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 23:10:14,191 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-27 23:10:14,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2035103234, now seen corresponding path program 5 times [2024-06-27 23:10:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:14,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827606717] [2024-06-27 23:10:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:14,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:15,897 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-27 23:10:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827606717] [2024-06-27 23:10:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827606717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:10:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692483099] [2024-06-27 23:10:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:15,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:10:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:10:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:10:16,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:10:16,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 298 transitions, 3579 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-27 23:10:16,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:16,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:10:16,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:16,948 INFO L124 PetriNetUnfolderBase]: 2663/4055 cut-off events. [2024-06-27 23:10:16,948 INFO L125 PetriNetUnfolderBase]: For 209520/209565 co-relation queries the response was YES. [2024-06-27 23:10:16,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30461 conditions, 4055 events. 2663/4055 cut-off events. For 209520/209565 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20634 event pairs, 1018 based on Foata normal form. 6/3999 useless extension candidates. Maximal degree in co-relation 30382. Up to 3740 conditions per place. [2024-06-27 23:10:16,982 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 282 selfloop transitions, 25 changer transitions 0/323 dead transitions. [2024-06-27 23:10:16,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 323 transitions, 4375 flow [2024-06-27 23:10:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:10:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:10:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 23:10:16,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 23:10:16,984 INFO L175 Difference]: Start difference. First operand has 170 places, 298 transitions, 3579 flow. Second operand 8 states and 148 transitions. [2024-06-27 23:10:16,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 323 transitions, 4375 flow [2024-06-27 23:10:17,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 323 transitions, 4290 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 23:10:17,235 INFO L231 Difference]: Finished difference. Result has 173 places, 301 transitions, 3609 flow [2024-06-27 23:10:17,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3494, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3609, PETRI_PLACES=173, PETRI_TRANSITIONS=301} [2024-06-27 23:10:17,235 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-27 23:10:17,236 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 301 transitions, 3609 flow [2024-06-27 23:10:17,236 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-27 23:10:17,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:17,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:17,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 23:10:17,236 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-27 23:10:17,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash 593753238, now seen corresponding path program 1 times [2024-06-27 23:10:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821473977] [2024-06-27 23:10:17,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:17,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:19,551 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-27 23:10:19,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:19,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821473977] [2024-06-27 23:10:19,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821473977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:19,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:19,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:10:19,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693549989] [2024-06-27 23:10:19,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:19,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:10:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:10:19,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:10:19,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:10:19,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 301 transitions, 3609 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-27 23:10:19,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:19,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:10:19,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:20,866 INFO L124 PetriNetUnfolderBase]: 2787/4204 cut-off events. [2024-06-27 23:10:20,866 INFO L125 PetriNetUnfolderBase]: For 210943/210970 co-relation queries the response was YES. [2024-06-27 23:10:20,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31064 conditions, 4204 events. 2787/4204 cut-off events. For 210943/210970 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 21008 event pairs, 1128 based on Foata normal form. 4/4177 useless extension candidates. Maximal degree in co-relation 30984. Up to 3996 conditions per place. [2024-06-27 23:10:20,893 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 303 selfloop transitions, 21 changer transitions 0/329 dead transitions. [2024-06-27 23:10:20,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 329 transitions, 4475 flow [2024-06-27 23:10:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 23:10:20,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4021164021164021 [2024-06-27 23:10:20,895 INFO L175 Difference]: Start difference. First operand has 173 places, 301 transitions, 3609 flow. Second operand 9 states and 152 transitions. [2024-06-27 23:10:20,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 329 transitions, 4475 flow [2024-06-27 23:10:21,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 329 transitions, 4386 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 23:10:21,111 INFO L231 Difference]: Finished difference. Result has 177 places, 307 transitions, 3680 flow [2024-06-27 23:10:21,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3520, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3680, PETRI_PLACES=177, PETRI_TRANSITIONS=307} [2024-06-27 23:10:21,112 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-27 23:10:21,112 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 307 transitions, 3680 flow [2024-06-27 23:10:21,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-27 23:10:21,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:21,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:21,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 23:10:21,113 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:10:21,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:21,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1358159770, now seen corresponding path program 1 times [2024-06-27 23:10:21,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:21,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227897595] [2024-06-27 23:10:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:22,820 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-27 23:10:22,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227897595] [2024-06-27 23:10:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227897595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:22,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:22,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:10:22,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097688528] [2024-06-27 23:10:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:22,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:10:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:22,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:10:22,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:10:22,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:10:22,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 307 transitions, 3680 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-27 23:10:22,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:22,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:10:22,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:23,799 INFO L124 PetriNetUnfolderBase]: 2620/4013 cut-off events. [2024-06-27 23:10:23,799 INFO L125 PetriNetUnfolderBase]: For 221807/221982 co-relation queries the response was YES. [2024-06-27 23:10:23,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29908 conditions, 4013 events. 2620/4013 cut-off events. For 221807/221982 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20704 event pairs, 1167 based on Foata normal form. 24/3977 useless extension candidates. Maximal degree in co-relation 29826. Up to 3727 conditions per place. [2024-06-27 23:10:23,837 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 246 selfloop transitions, 13 changer transitions 0/320 dead transitions. [2024-06-27 23:10:23,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 320 transitions, 4266 flow [2024-06-27 23:10:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:10:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:10:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-27 23:10:23,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2024-06-27 23:10:23,838 INFO L175 Difference]: Start difference. First operand has 177 places, 307 transitions, 3680 flow. Second operand 6 states and 109 transitions. [2024-06-27 23:10:23,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 320 transitions, 4266 flow [2024-06-27 23:10:24,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 320 transitions, 4157 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-27 23:10:24,163 INFO L231 Difference]: Finished difference. Result has 177 places, 310 transitions, 3637 flow [2024-06-27 23:10:24,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3571, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3637, PETRI_PLACES=177, PETRI_TRANSITIONS=310} [2024-06-27 23:10:24,163 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-27 23:10:24,164 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 310 transitions, 3637 flow [2024-06-27 23:10:24,164 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-27 23:10:24,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:24,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:24,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 23:10:24,164 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-27 23:10:24,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash 715406006, now seen corresponding path program 1 times [2024-06-27 23:10:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:24,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747733949] [2024-06-27 23:10:24,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:24,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:26,535 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-27 23:10:26,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:26,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747733949] [2024-06-27 23:10:26,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747733949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:26,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749247932] [2024-06-27 23:10:26,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:26,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:26,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:26,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:26,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:10:26,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 310 transitions, 3637 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-27 23:10:26,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:26,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:10:26,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:27,944 INFO L124 PetriNetUnfolderBase]: 2782/4242 cut-off events. [2024-06-27 23:10:27,944 INFO L125 PetriNetUnfolderBase]: For 247678/247737 co-relation queries the response was YES. [2024-06-27 23:10:27,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33171 conditions, 4242 events. 2782/4242 cut-off events. For 247678/247737 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 21854 event pairs, 856 based on Foata normal form. 17/4211 useless extension candidates. Maximal degree in co-relation 33088. Up to 3593 conditions per place. [2024-06-27 23:10:27,977 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 269 selfloop transitions, 110 changer transitions 0/396 dead transitions. [2024-06-27 23:10:27,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 396 transitions, 5452 flow [2024-06-27 23:10:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:10:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:10:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-06-27 23:10:27,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2024-06-27 23:10:27,979 INFO L175 Difference]: Start difference. First operand has 177 places, 310 transitions, 3637 flow. Second operand 12 states and 237 transitions. [2024-06-27 23:10:27,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 396 transitions, 5452 flow [2024-06-27 23:10:28,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 396 transitions, 5420 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 23:10:28,310 INFO L231 Difference]: Finished difference. Result has 188 places, 342 transitions, 4302 flow [2024-06-27 23:10:28,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3605, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4302, PETRI_PLACES=188, PETRI_TRANSITIONS=342} [2024-06-27 23:10:28,311 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2024-06-27 23:10:28,311 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 342 transitions, 4302 flow [2024-06-27 23:10:28,311 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-27 23:10:28,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:28,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:28,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 23:10:28,311 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-27 23:10:28,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1769263332, now seen corresponding path program 1 times [2024-06-27 23:10:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:28,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608585489] [2024-06-27 23:10:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:29,834 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-27 23:10:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608585489] [2024-06-27 23:10:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608585489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:29,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:29,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:10:29,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173019454] [2024-06-27 23:10:29,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:29,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:10:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:10:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:10:29,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-27 23:10:29,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 342 transitions, 4302 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-27 23:10:29,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:29,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-27 23:10:29,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:31,092 INFO L124 PetriNetUnfolderBase]: 2551/4029 cut-off events. [2024-06-27 23:10:31,092 INFO L125 PetriNetUnfolderBase]: For 295123/295225 co-relation queries the response was YES. [2024-06-27 23:10:31,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35140 conditions, 4029 events. 2551/4029 cut-off events. For 295123/295225 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 22565 event pairs, 590 based on Foata normal form. 19/3899 useless extension candidates. Maximal degree in co-relation 35052. Up to 3134 conditions per place. [2024-06-27 23:10:31,133 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 243 selfloop transitions, 99 changer transitions 0/389 dead transitions. [2024-06-27 23:10:31,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 389 transitions, 5580 flow [2024-06-27 23:10:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:10:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:10:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2024-06-27 23:10:31,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-06-27 23:10:31,135 INFO L175 Difference]: Start difference. First operand has 188 places, 342 transitions, 4302 flow. Second operand 10 states and 218 transitions. [2024-06-27 23:10:31,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 389 transitions, 5580 flow [2024-06-27 23:10:31,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 389 transitions, 5462 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-27 23:10:31,553 INFO L231 Difference]: Finished difference. Result has 195 places, 352 transitions, 4673 flow [2024-06-27 23:10:31,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4184, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4673, PETRI_PLACES=195, PETRI_TRANSITIONS=352} [2024-06-27 23:10:31,554 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places. [2024-06-27 23:10:31,554 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 352 transitions, 4673 flow [2024-06-27 23:10:31,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-27 23:10:31,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:31,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:31,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 23:10:31,554 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-27 23:10:31,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash 535749628, now seen corresponding path program 2 times [2024-06-27 23:10:31,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:31,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375319691] [2024-06-27 23:10:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:31,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:33,387 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-27 23:10:33,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:33,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375319691] [2024-06-27 23:10:33,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375319691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:33,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:33,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:10:33,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548080166] [2024-06-27 23:10:33,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:33,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:10:33,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:33,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:10:33,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:10:33,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:10:33,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 352 transitions, 4673 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-27 23:10:33,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:33,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:10:33,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:34,837 INFO L124 PetriNetUnfolderBase]: 2969/4558 cut-off events. [2024-06-27 23:10:34,838 INFO L125 PetriNetUnfolderBase]: For 292841/292897 co-relation queries the response was YES. [2024-06-27 23:10:34,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38027 conditions, 4558 events. 2969/4558 cut-off events. For 292841/292897 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 24008 event pairs, 789 based on Foata normal form. 19/4533 useless extension candidates. Maximal degree in co-relation 37935. Up to 3685 conditions per place. [2024-06-27 23:10:34,880 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 252 selfloop transitions, 144 changer transitions 0/413 dead transitions. [2024-06-27 23:10:34,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 413 transitions, 6256 flow [2024-06-27 23:10:34,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:10:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:10:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-06-27 23:10:34,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-06-27 23:10:34,882 INFO L175 Difference]: Start difference. First operand has 195 places, 352 transitions, 4673 flow. Second operand 11 states and 216 transitions. [2024-06-27 23:10:34,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 413 transitions, 6256 flow [2024-06-27 23:10:35,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 413 transitions, 6130 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-27 23:10:35,371 INFO L231 Difference]: Finished difference. Result has 203 places, 374 transitions, 5316 flow [2024-06-27 23:10:35,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4553, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5316, PETRI_PLACES=203, PETRI_TRANSITIONS=374} [2024-06-27 23:10:35,371 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places. [2024-06-27 23:10:35,372 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 374 transitions, 5316 flow [2024-06-27 23:10:35,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-27 23:10:35,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:35,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:35,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 23:10:35,372 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-27 23:10:35,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash 630787042, now seen corresponding path program 2 times [2024-06-27 23:10:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:35,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162442397] [2024-06-27 23:10:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:37,880 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-27 23:10:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:37,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162442397] [2024-06-27 23:10:37,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162442397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:37,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:37,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:37,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830329043] [2024-06-27 23:10:37,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:37,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:38,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:10:38,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 374 transitions, 5316 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:38,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:38,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:10:38,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:39,288 INFO L124 PetriNetUnfolderBase]: 3115/4706 cut-off events. [2024-06-27 23:10:39,288 INFO L125 PetriNetUnfolderBase]: For 319086/319147 co-relation queries the response was YES. [2024-06-27 23:10:39,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41466 conditions, 4706 events. 3115/4706 cut-off events. For 319086/319147 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 24725 event pairs, 711 based on Foata normal form. 21/4605 useless extension candidates. Maximal degree in co-relation 41372. Up to 3988 conditions per place. [2024-06-27 23:10:39,328 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 293 selfloop transitions, 111 changer transitions 0/421 dead transitions. [2024-06-27 23:10:39,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 421 transitions, 6689 flow [2024-06-27 23:10:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:10:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:10:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-27 23:10:39,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 23:10:39,330 INFO L175 Difference]: Start difference. First operand has 203 places, 374 transitions, 5316 flow. Second operand 10 states and 204 transitions. [2024-06-27 23:10:39,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 421 transitions, 6689 flow [2024-06-27 23:10:39,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 421 transitions, 6499 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-27 23:10:39,757 INFO L231 Difference]: Finished difference. Result has 206 places, 380 transitions, 5494 flow [2024-06-27 23:10:39,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5144, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5494, PETRI_PLACES=206, PETRI_TRANSITIONS=380} [2024-06-27 23:10:39,758 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 163 predicate places. [2024-06-27 23:10:39,758 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 380 transitions, 5494 flow [2024-06-27 23:10:39,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:39,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:39,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:39,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 23:10:39,759 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-27 23:10:39,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1834935086, now seen corresponding path program 3 times [2024-06-27 23:10:39,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:39,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159305847] [2024-06-27 23:10:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:42,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-27 23:10:42,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:42,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159305847] [2024-06-27 23:10:42,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159305847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:42,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:42,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628291049] [2024-06-27 23:10:42,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:42,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:42,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:42,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:42,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:42,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:10:42,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 380 transitions, 5494 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:42,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:42,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:10:42,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:43,802 INFO L124 PetriNetUnfolderBase]: 3091/4716 cut-off events. [2024-06-27 23:10:43,802 INFO L125 PetriNetUnfolderBase]: For 302953/303008 co-relation queries the response was YES. [2024-06-27 23:10:43,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40939 conditions, 4716 events. 3091/4716 cut-off events. For 302953/303008 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 24879 event pairs, 864 based on Foata normal form. 21/4643 useless extension candidates. Maximal degree in co-relation 40844. Up to 4107 conditions per place. [2024-06-27 23:10:43,851 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 301 selfloop transitions, 105 changer transitions 0/423 dead transitions. [2024-06-27 23:10:43,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 423 transitions, 6705 flow [2024-06-27 23:10:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:10:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:10:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-06-27 23:10:43,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-27 23:10:43,853 INFO L175 Difference]: Start difference. First operand has 206 places, 380 transitions, 5494 flow. Second operand 10 states and 201 transitions. [2024-06-27 23:10:43,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 423 transitions, 6705 flow [2024-06-27 23:10:44,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 423 transitions, 6359 flow, removed 76 selfloop flow, removed 7 redundant places. [2024-06-27 23:10:44,339 INFO L231 Difference]: Finished difference. Result has 209 places, 384 transitions, 5484 flow [2024-06-27 23:10:44,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5176, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5484, PETRI_PLACES=209, PETRI_TRANSITIONS=384} [2024-06-27 23:10:44,339 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places. [2024-06-27 23:10:44,340 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 384 transitions, 5484 flow [2024-06-27 23:10:44,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:44,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:44,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:44,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 23:10:44,340 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-27 23:10:44,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2112877036, now seen corresponding path program 3 times [2024-06-27 23:10:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:44,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303677540] [2024-06-27 23:10:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:46,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-27 23:10:46,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:46,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303677540] [2024-06-27 23:10:46,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303677540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:46,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:46,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:46,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362224954] [2024-06-27 23:10:46,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:46,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:46,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:46,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:46,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:46,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:10:46,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 384 transitions, 5484 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:46,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:46,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:10:46,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:48,213 INFO L124 PetriNetUnfolderBase]: 3212/4936 cut-off events. [2024-06-27 23:10:48,213 INFO L125 PetriNetUnfolderBase]: For 329192/329236 co-relation queries the response was YES. [2024-06-27 23:10:48,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42733 conditions, 4936 events. 3212/4936 cut-off events. For 329192/329236 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 26462 event pairs, 881 based on Foata normal form. 23/4915 useless extension candidates. Maximal degree in co-relation 42637. Up to 4116 conditions per place. [2024-06-27 23:10:48,260 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 311 selfloop transitions, 114 changer transitions 0/442 dead transitions. [2024-06-27 23:10:48,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 442 transitions, 7286 flow [2024-06-27 23:10:48,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-06-27 23:10:48,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973544973544973 [2024-06-27 23:10:48,262 INFO L175 Difference]: Start difference. First operand has 209 places, 384 transitions, 5484 flow. Second operand 9 states and 188 transitions. [2024-06-27 23:10:48,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 442 transitions, 7286 flow [2024-06-27 23:10:48,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 442 transitions, 7036 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-27 23:10:48,772 INFO L231 Difference]: Finished difference. Result has 210 places, 402 transitions, 5850 flow [2024-06-27 23:10:48,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5234, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5850, PETRI_PLACES=210, PETRI_TRANSITIONS=402} [2024-06-27 23:10:48,773 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places. [2024-06-27 23:10:48,773 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 402 transitions, 5850 flow [2024-06-27 23:10:48,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:48,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:48,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:48,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 23:10:48,774 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-27 23:10:48,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:48,774 INFO L85 PathProgramCache]: Analyzing trace with hash 719364892, now seen corresponding path program 4 times [2024-06-27 23:10:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:48,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915435447] [2024-06-27 23:10:48,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:48,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:51,322 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-27 23:10:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915435447] [2024-06-27 23:10:51,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915435447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:51,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:51,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369751670] [2024-06-27 23:10:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:51,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:51,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:51,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:51,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:10:51,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 402 transitions, 5850 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:51,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:51,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:10:51,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:52,800 INFO L124 PetriNetUnfolderBase]: 3213/4915 cut-off events. [2024-06-27 23:10:52,801 INFO L125 PetriNetUnfolderBase]: For 330919/330962 co-relation queries the response was YES. [2024-06-27 23:10:52,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42952 conditions, 4915 events. 3213/4915 cut-off events. For 330919/330962 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 26231 event pairs, 911 based on Foata normal form. 13/4844 useless extension candidates. Maximal degree in co-relation 42855. Up to 4376 conditions per place. [2024-06-27 23:10:52,845 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 343 selfloop transitions, 73 changer transitions 0/433 dead transitions. [2024-06-27 23:10:52,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 433 transitions, 6887 flow [2024-06-27 23:10:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 23:10:52,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47354497354497355 [2024-06-27 23:10:52,846 INFO L175 Difference]: Start difference. First operand has 210 places, 402 transitions, 5850 flow. Second operand 9 states and 179 transitions. [2024-06-27 23:10:52,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 433 transitions, 6887 flow [2024-06-27 23:10:53,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 433 transitions, 6610 flow, removed 92 selfloop flow, removed 5 redundant places. [2024-06-27 23:10:53,290 INFO L231 Difference]: Finished difference. Result has 214 places, 402 transitions, 5731 flow [2024-06-27 23:10:53,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5573, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5731, PETRI_PLACES=214, PETRI_TRANSITIONS=402} [2024-06-27 23:10:53,291 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places. [2024-06-27 23:10:53,291 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 402 transitions, 5731 flow [2024-06-27 23:10:53,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:53,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:53,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:53,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 23:10:53,292 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-27 23:10:53,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash 719504516, now seen corresponding path program 4 times [2024-06-27 23:10:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982794936] [2024-06-27 23:10:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:10:55,729 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-27 23:10:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:10:55,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982794936] [2024-06-27 23:10:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982794936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:10:55,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:10:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:10:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304677941] [2024-06-27 23:10:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:10:55,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:10:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:10:55,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:10:55,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:10:55,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:10:55,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 402 transitions, 5731 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:55,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:10:55,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:10:55,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:10:57,088 INFO L124 PetriNetUnfolderBase]: 3162/4868 cut-off events. [2024-06-27 23:10:57,088 INFO L125 PetriNetUnfolderBase]: For 335840/335884 co-relation queries the response was YES. [2024-06-27 23:10:57,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41851 conditions, 4868 events. 3162/4868 cut-off events. For 335840/335884 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 26130 event pairs, 877 based on Foata normal form. 25/4849 useless extension candidates. Maximal degree in co-relation 41752. Up to 4174 conditions per place. [2024-06-27 23:10:57,136 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 320 selfloop transitions, 100 changer transitions 0/437 dead transitions. [2024-06-27 23:10:57,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 437 transitions, 6989 flow [2024-06-27 23:10:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:10:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:10:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-27 23:10:57,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-27 23:10:57,138 INFO L175 Difference]: Start difference. First operand has 214 places, 402 transitions, 5731 flow. Second operand 9 states and 183 transitions. [2024-06-27 23:10:57,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 437 transitions, 6989 flow [2024-06-27 23:10:57,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 437 transitions, 6711 flow, removed 56 selfloop flow, removed 8 redundant places. [2024-06-27 23:10:57,718 INFO L231 Difference]: Finished difference. Result has 215 places, 402 transitions, 5682 flow [2024-06-27 23:10:57,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5453, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5682, PETRI_PLACES=215, PETRI_TRANSITIONS=402} [2024-06-27 23:10:57,719 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places. [2024-06-27 23:10:57,719 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 402 transitions, 5682 flow [2024-06-27 23:10:57,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:10:57,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:10:57,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:10:57,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 23:10:57,720 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-27 23:10:57,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:10:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash -428624450, now seen corresponding path program 5 times [2024-06-27 23:10:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:10:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819374655] [2024-06-27 23:10:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:10:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:10:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:00,180 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-27 23:11:00,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819374655] [2024-06-27 23:11:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819374655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:00,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175797626] [2024-06-27 23:11:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:00,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:00,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:00,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:11:00,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 402 transitions, 5682 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:00,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:00,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:11:00,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:01,500 INFO L124 PetriNetUnfolderBase]: 3136/4837 cut-off events. [2024-06-27 23:11:01,500 INFO L125 PetriNetUnfolderBase]: For 336740/336796 co-relation queries the response was YES. [2024-06-27 23:11:01,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41424 conditions, 4837 events. 3136/4837 cut-off events. For 336740/336796 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 26050 event pairs, 804 based on Foata normal form. 23/4816 useless extension candidates. Maximal degree in co-relation 41324. Up to 3886 conditions per place. [2024-06-27 23:11:01,551 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 271 selfloop transitions, 158 changer transitions 0/446 dead transitions. [2024-06-27 23:11:01,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 446 transitions, 7054 flow [2024-06-27 23:11:01,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:11:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:11:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2024-06-27 23:11:01,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-27 23:11:01,553 INFO L175 Difference]: Start difference. First operand has 215 places, 402 transitions, 5682 flow. Second operand 10 states and 208 transitions. [2024-06-27 23:11:01,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 446 transitions, 7054 flow [2024-06-27 23:11:02,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 446 transitions, 6823 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-27 23:11:02,111 INFO L231 Difference]: Finished difference. Result has 218 places, 402 transitions, 5793 flow [2024-06-27 23:11:02,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5451, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5793, PETRI_PLACES=218, PETRI_TRANSITIONS=402} [2024-06-27 23:11:02,112 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places. [2024-06-27 23:11:02,112 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 402 transitions, 5793 flow [2024-06-27 23:11:02,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:02,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:02,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:02,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 23:11:02,113 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-27 23:11:02,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash -59202086, now seen corresponding path program 6 times [2024-06-27 23:11:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:02,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389116087] [2024-06-27 23:11:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:04,502 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-27 23:11:04,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:04,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389116087] [2024-06-27 23:11:04,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389116087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:04,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:04,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891400361] [2024-06-27 23:11:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:04,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:04,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:04,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:04,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:04,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:11:04,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 402 transitions, 5793 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:04,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:04,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:11:04,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:05,880 INFO L124 PetriNetUnfolderBase]: 3282/5031 cut-off events. [2024-06-27 23:11:05,880 INFO L125 PetriNetUnfolderBase]: For 359629/359676 co-relation queries the response was YES. [2024-06-27 23:11:06,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43769 conditions, 5031 events. 3282/5031 cut-off events. For 359629/359676 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 27022 event pairs, 814 based on Foata normal form. 46/5028 useless extension candidates. Maximal degree in co-relation 43668. Up to 3940 conditions per place. [2024-06-27 23:11:06,049 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 253 selfloop transitions, 198 changer transitions 0/468 dead transitions. [2024-06-27 23:11:06,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 468 transitions, 7869 flow [2024-06-27 23:11:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-27 23:11:06,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105820105820106 [2024-06-27 23:11:06,051 INFO L175 Difference]: Start difference. First operand has 218 places, 402 transitions, 5793 flow. Second operand 9 states and 193 transitions. [2024-06-27 23:11:06,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 468 transitions, 7869 flow [2024-06-27 23:11:06,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 468 transitions, 7394 flow, removed 46 selfloop flow, removed 10 redundant places. [2024-06-27 23:11:06,547 INFO L231 Difference]: Finished difference. Result has 219 places, 423 transitions, 6298 flow [2024-06-27 23:11:06,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5326, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6298, PETRI_PLACES=219, PETRI_TRANSITIONS=423} [2024-06-27 23:11:06,548 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 176 predicate places. [2024-06-27 23:11:06,548 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 423 transitions, 6298 flow [2024-06-27 23:11:06,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:06,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:06,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:06,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 23:11:06,549 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-27 23:11:06,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1775754910, now seen corresponding path program 1 times [2024-06-27 23:11:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:06,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409226210] [2024-06-27 23:11:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:06,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:08,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-27 23:11:08,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409226210] [2024-06-27 23:11:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409226210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510973143] [2024-06-27 23:11:08,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:08,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:08,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:08,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:08,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:11:08,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 423 transitions, 6298 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:11:08,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:08,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:11:08,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:10,090 INFO L124 PetriNetUnfolderBase]: 3515/5311 cut-off events. [2024-06-27 23:11:10,090 INFO L125 PetriNetUnfolderBase]: For 355797/355816 co-relation queries the response was YES. [2024-06-27 23:11:10,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45336 conditions, 5311 events. 3515/5311 cut-off events. For 355797/355816 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27802 event pairs, 1038 based on Foata normal form. 4/5292 useless extension candidates. Maximal degree in co-relation 45234. Up to 4845 conditions per place. [2024-06-27 23:11:10,149 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 370 selfloop transitions, 98 changer transitions 0/473 dead transitions. [2024-06-27 23:11:10,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 473 transitions, 7674 flow [2024-06-27 23:11:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-27 23:11:10,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2024-06-27 23:11:10,151 INFO L175 Difference]: Start difference. First operand has 219 places, 423 transitions, 6298 flow. Second operand 9 states and 172 transitions. [2024-06-27 23:11:10,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 473 transitions, 7674 flow [2024-06-27 23:11:10,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 473 transitions, 7399 flow, removed 95 selfloop flow, removed 5 redundant places. [2024-06-27 23:11:10,815 INFO L231 Difference]: Finished difference. Result has 225 places, 442 transitions, 6515 flow [2024-06-27 23:11:10,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6032, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6515, PETRI_PLACES=225, PETRI_TRANSITIONS=442} [2024-06-27 23:11:10,816 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-27 23:11:10,816 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 442 transitions, 6515 flow [2024-06-27 23:11:10,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:11:10,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:10,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:10,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 23:11:10,817 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:10,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash -59375066, now seen corresponding path program 7 times [2024-06-27 23:11:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145112086] [2024-06-27 23:11:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:13,221 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-27 23:11:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145112086] [2024-06-27 23:11:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145112086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:13,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127064319] [2024-06-27 23:11:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:13,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:13,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:13,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:11:13,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 442 transitions, 6515 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:13,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:13,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:11:13,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:14,805 INFO L124 PetriNetUnfolderBase]: 3316/5084 cut-off events. [2024-06-27 23:11:14,805 INFO L125 PetriNetUnfolderBase]: For 350467/350495 co-relation queries the response was YES. [2024-06-27 23:11:14,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44192 conditions, 5084 events. 3316/5084 cut-off events. For 350467/350495 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 27262 event pairs, 817 based on Foata normal form. 27/5067 useless extension candidates. Maximal degree in co-relation 44088. Up to 3970 conditions per place. [2024-06-27 23:11:14,853 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 268 selfloop transitions, 204 changer transitions 0/491 dead transitions. [2024-06-27 23:11:14,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 491 transitions, 8304 flow [2024-06-27 23:11:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-27 23:11:14,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-27 23:11:14,856 INFO L175 Difference]: Start difference. First operand has 225 places, 442 transitions, 6515 flow. Second operand 9 states and 195 transitions. [2024-06-27 23:11:14,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 491 transitions, 8304 flow [2024-06-27 23:11:15,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 491 transitions, 8124 flow, removed 39 selfloop flow, removed 4 redundant places. [2024-06-27 23:11:15,456 INFO L231 Difference]: Finished difference. Result has 231 places, 445 transitions, 6876 flow [2024-06-27 23:11:15,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6355, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6876, PETRI_PLACES=231, PETRI_TRANSITIONS=445} [2024-06-27 23:11:15,456 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places. [2024-06-27 23:11:15,456 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 445 transitions, 6876 flow [2024-06-27 23:11:15,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:15,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:15,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:15,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 23:11:15,457 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-27 23:11:15,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1775939484, now seen corresponding path program 8 times [2024-06-27 23:11:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606545339] [2024-06-27 23:11:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:18,108 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-27 23:11:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:18,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606545339] [2024-06-27 23:11:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606545339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:18,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:18,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63720818] [2024-06-27 23:11:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:18,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:18,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:11:18,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 445 transitions, 6876 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:18,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:18,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:11:18,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:19,548 INFO L124 PetriNetUnfolderBase]: 3337/5129 cut-off events. [2024-06-27 23:11:19,548 INFO L125 PetriNetUnfolderBase]: For 381718/381746 co-relation queries the response was YES. [2024-06-27 23:11:19,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46003 conditions, 5129 events. 3337/5129 cut-off events. For 381718/381746 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 27648 event pairs, 801 based on Foata normal form. 22/5110 useless extension candidates. Maximal degree in co-relation 45897. Up to 3879 conditions per place. [2024-06-27 23:11:19,601 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 263 selfloop transitions, 214 changer transitions 0/496 dead transitions. [2024-06-27 23:11:19,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 496 transitions, 8729 flow [2024-06-27 23:11:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2024-06-27 23:11:19,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-27 23:11:19,603 INFO L175 Difference]: Start difference. First operand has 231 places, 445 transitions, 6876 flow. Second operand 9 states and 195 transitions. [2024-06-27 23:11:19,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 496 transitions, 8729 flow [2024-06-27 23:11:20,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 496 transitions, 8101 flow, removed 77 selfloop flow, removed 8 redundant places. [2024-06-27 23:11:20,433 INFO L231 Difference]: Finished difference. Result has 233 places, 451 transitions, 6931 flow [2024-06-27 23:11:20,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6264, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6931, PETRI_PLACES=233, PETRI_TRANSITIONS=451} [2024-06-27 23:11:20,433 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places. [2024-06-27 23:11:20,433 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 451 transitions, 6931 flow [2024-06-27 23:11:20,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:20,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:20,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:20,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 23:11:20,434 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-27 23:11:20,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash -59379840, now seen corresponding path program 5 times [2024-06-27 23:11:20,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:20,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776557197] [2024-06-27 23:11:20,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:22,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-27 23:11:22,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:22,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776557197] [2024-06-27 23:11:22,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776557197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:22,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:22,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:22,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366730245] [2024-06-27 23:11:22,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:22,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:22,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:23,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:11:23,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 451 transitions, 6931 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:23,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:23,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:11:23,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:24,350 INFO L124 PetriNetUnfolderBase]: 3335/5132 cut-off events. [2024-06-27 23:11:24,350 INFO L125 PetriNetUnfolderBase]: For 359845/359872 co-relation queries the response was YES. [2024-06-27 23:11:24,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45951 conditions, 5132 events. 3335/5132 cut-off events. For 359845/359872 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 27593 event pairs, 796 based on Foata normal form. 22/5128 useless extension candidates. Maximal degree in co-relation 45844. Up to 4504 conditions per place. [2024-06-27 23:11:24,406 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 369 selfloop transitions, 96 changer transitions 0/484 dead transitions. [2024-06-27 23:11:24,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 484 transitions, 8186 flow [2024-06-27 23:11:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-27 23:11:24,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 23:11:24,407 INFO L175 Difference]: Start difference. First operand has 233 places, 451 transitions, 6931 flow. Second operand 9 states and 180 transitions. [2024-06-27 23:11:24,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 484 transitions, 8186 flow [2024-06-27 23:11:25,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 484 transitions, 7936 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-27 23:11:25,042 INFO L231 Difference]: Finished difference. Result has 237 places, 453 transitions, 6946 flow [2024-06-27 23:11:25,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6681, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6946, PETRI_PLACES=237, PETRI_TRANSITIONS=453} [2024-06-27 23:11:25,043 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2024-06-27 23:11:25,043 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 453 transitions, 6946 flow [2024-06-27 23:11:25,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:11:25,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:25,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:25,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 23:11:25,044 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:25,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1989681320, now seen corresponding path program 1 times [2024-06-27 23:11:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:25,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862373348] [2024-06-27 23:11:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:26,617 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-27 23:11:26,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:26,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862373348] [2024-06-27 23:11:26,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862373348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:26,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:26,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:11:26,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682743155] [2024-06-27 23:11:26,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:26,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:11:26,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:26,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:11:26,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:11:26,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:11:26,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 453 transitions, 6946 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-27 23:11:26,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:26,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:11:26,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:27,840 INFO L124 PetriNetUnfolderBase]: 3385/5223 cut-off events. [2024-06-27 23:11:27,840 INFO L125 PetriNetUnfolderBase]: For 371933/371974 co-relation queries the response was YES. [2024-06-27 23:11:27,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46421 conditions, 5223 events. 3385/5223 cut-off events. For 371933/371974 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 28333 event pairs, 941 based on Foata normal form. 23/5226 useless extension candidates. Maximal degree in co-relation 46312. Up to 4735 conditions per place. [2024-06-27 23:11:27,896 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 357 selfloop transitions, 41 changer transitions 0/477 dead transitions. [2024-06-27 23:11:27,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 477 transitions, 8000 flow [2024-06-27 23:11:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:11:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:11:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 23:11:27,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:11:27,897 INFO L175 Difference]: Start difference. First operand has 237 places, 453 transitions, 6946 flow. Second operand 7 states and 133 transitions. [2024-06-27 23:11:27,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 477 transitions, 8000 flow [2024-06-27 23:11:28,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 477 transitions, 7753 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-27 23:11:28,715 INFO L231 Difference]: Finished difference. Result has 237 places, 459 transitions, 6867 flow [2024-06-27 23:11:28,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6699, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6867, PETRI_PLACES=237, PETRI_TRANSITIONS=459} [2024-06-27 23:11:28,716 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2024-06-27 23:11:28,716 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 459 transitions, 6867 flow [2024-06-27 23:11:28,716 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-27 23:11:28,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:28,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:28,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 23:11:28,716 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-27 23:11:28,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash -572037140, now seen corresponding path program 1 times [2024-06-27 23:11:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863557547] [2024-06-27 23:11:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:28,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:31,015 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-27 23:11:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863557547] [2024-06-27 23:11:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863557547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:31,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:31,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405606083] [2024-06-27 23:11:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:31,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:31,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:31,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:31,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:11:31,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 459 transitions, 6867 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-27 23:11:31,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:31,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:11:31,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:32,818 INFO L124 PetriNetUnfolderBase]: 3451/5301 cut-off events. [2024-06-27 23:11:32,818 INFO L125 PetriNetUnfolderBase]: For 423510/423543 co-relation queries the response was YES. [2024-06-27 23:11:32,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48970 conditions, 5301 events. 3451/5301 cut-off events. For 423510/423543 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 28837 event pairs, 798 based on Foata normal form. 21/5268 useless extension candidates. Maximal degree in co-relation 48860. Up to 4236 conditions per place. [2024-06-27 23:11:32,879 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 326 selfloop transitions, 163 changer transitions 0/510 dead transitions. [2024-06-27 23:11:32,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 510 transitions, 8693 flow [2024-06-27 23:11:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:11:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:11:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2024-06-27 23:11:32,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-06-27 23:11:32,881 INFO L175 Difference]: Start difference. First operand has 237 places, 459 transitions, 6867 flow. Second operand 12 states and 236 transitions. [2024-06-27 23:11:32,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 510 transitions, 8693 flow [2024-06-27 23:11:33,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 510 transitions, 8633 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-27 23:11:33,576 INFO L231 Difference]: Finished difference. Result has 247 places, 463 transitions, 7270 flow [2024-06-27 23:11:33,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6807, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7270, PETRI_PLACES=247, PETRI_TRANSITIONS=463} [2024-06-27 23:11:33,576 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2024-06-27 23:11:33,577 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 463 transitions, 7270 flow [2024-06-27 23:11:33,577 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-27 23:11:33,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:33,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:33,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 23:11:33,577 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-27 23:11:33,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:33,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1004259034, now seen corresponding path program 1 times [2024-06-27 23:11:33,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731270259] [2024-06-27 23:11:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:33,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:35,222 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-27 23:11:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731270259] [2024-06-27 23:11:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731270259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805822391] [2024-06-27 23:11:35,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:35,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:35,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:11:35,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 463 transitions, 7270 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:11:35,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:35,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:11:35,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:36,623 INFO L124 PetriNetUnfolderBase]: 3706/5613 cut-off events. [2024-06-27 23:11:36,624 INFO L125 PetriNetUnfolderBase]: For 424759/424770 co-relation queries the response was YES. [2024-06-27 23:11:36,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51602 conditions, 5613 events. 3706/5613 cut-off events. For 424759/424770 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 29802 event pairs, 1267 based on Foata normal form. 3/5597 useless extension candidates. Maximal degree in co-relation 51489. Up to 5299 conditions per place. [2024-06-27 23:11:36,687 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 431 selfloop transitions, 55 changer transitions 0/493 dead transitions. [2024-06-27 23:11:36,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 493 transitions, 8461 flow [2024-06-27 23:11:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 23:11:36,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-27 23:11:36,688 INFO L175 Difference]: Start difference. First operand has 247 places, 463 transitions, 7270 flow. Second operand 9 states and 159 transitions. [2024-06-27 23:11:36,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 493 transitions, 8461 flow [2024-06-27 23:11:37,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 493 transitions, 8190 flow, removed 53 selfloop flow, removed 7 redundant places. [2024-06-27 23:11:37,917 INFO L231 Difference]: Finished difference. Result has 249 places, 469 transitions, 7245 flow [2024-06-27 23:11:37,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7006, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7245, PETRI_PLACES=249, PETRI_TRANSITIONS=469} [2024-06-27 23:11:37,918 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places. [2024-06-27 23:11:37,918 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 469 transitions, 7245 flow [2024-06-27 23:11:37,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:11:37,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:37,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:37,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 23:11:37,919 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:37,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:37,919 INFO L85 PathProgramCache]: Analyzing trace with hash -691218739, now seen corresponding path program 1 times [2024-06-27 23:11:37,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:37,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545348234] [2024-06-27 23:11:37,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:37,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:39,576 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-27 23:11:39,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:39,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545348234] [2024-06-27 23:11:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545348234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:11:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722874494] [2024-06-27 23:11:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:39,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:11:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:11:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:11:39,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:11:39,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 469 transitions, 7245 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-27 23:11:39,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:39,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:11:39,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:40,822 INFO L124 PetriNetUnfolderBase]: 3498/5382 cut-off events. [2024-06-27 23:11:40,822 INFO L125 PetriNetUnfolderBase]: For 431477/431614 co-relation queries the response was YES. [2024-06-27 23:11:40,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49333 conditions, 5382 events. 3498/5382 cut-off events. For 431477/431614 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29694 event pairs, 1285 based on Foata normal form. 53/5362 useless extension candidates. Maximal degree in co-relation 49218. Up to 4921 conditions per place. [2024-06-27 23:11:40,896 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 381 selfloop transitions, 38 changer transitions 0/498 dead transitions. [2024-06-27 23:11:40,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 498 transitions, 8482 flow [2024-06-27 23:11:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:11:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:11:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 23:11:40,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-27 23:11:40,899 INFO L175 Difference]: Start difference. First operand has 249 places, 469 transitions, 7245 flow. Second operand 7 states and 131 transitions. [2024-06-27 23:11:40,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 498 transitions, 8482 flow [2024-06-27 23:11:41,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 498 transitions, 8389 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 23:11:41,683 INFO L231 Difference]: Finished difference. Result has 253 places, 484 transitions, 7419 flow [2024-06-27 23:11:41,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7152, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7419, PETRI_PLACES=253, PETRI_TRANSITIONS=484} [2024-06-27 23:11:41,683 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places. [2024-06-27 23:11:41,683 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 484 transitions, 7419 flow [2024-06-27 23:11:41,683 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-27 23:11:41,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:41,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:41,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 23:11:41,684 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-27 23:11:41,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2086749098, now seen corresponding path program 2 times [2024-06-27 23:11:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202190199] [2024-06-27 23:11:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:44,490 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-27 23:11:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202190199] [2024-06-27 23:11:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202190199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:44,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:44,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:11:44,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079319348] [2024-06-27 23:11:44,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:44,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:11:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:44,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:11:44,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:11:44,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:11:44,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 484 transitions, 7419 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:11:44,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:44,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:11:44,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:46,312 INFO L124 PetriNetUnfolderBase]: 3743/5732 cut-off events. [2024-06-27 23:11:46,312 INFO L125 PetriNetUnfolderBase]: For 555767/555806 co-relation queries the response was YES. [2024-06-27 23:11:46,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56691 conditions, 5732 events. 3743/5732 cut-off events. For 555767/555806 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 31757 event pairs, 660 based on Foata normal form. 34/5686 useless extension candidates. Maximal degree in co-relation 56572. Up to 3989 conditions per place. [2024-06-27 23:11:46,380 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 349 selfloop transitions, 171 changer transitions 0/543 dead transitions. [2024-06-27 23:11:46,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 543 transitions, 9397 flow [2024-06-27 23:11:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:11:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:11:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 234 transitions. [2024-06-27 23:11:46,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064935064935064 [2024-06-27 23:11:46,385 INFO L175 Difference]: Start difference. First operand has 253 places, 484 transitions, 7419 flow. Second operand 11 states and 234 transitions. [2024-06-27 23:11:46,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 543 transitions, 9397 flow [2024-06-27 23:11:47,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 543 transitions, 9354 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 23:11:47,445 INFO L231 Difference]: Finished difference. Result has 263 places, 486 transitions, 7828 flow [2024-06-27 23:11:47,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7376, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7828, PETRI_PLACES=263, PETRI_TRANSITIONS=486} [2024-06-27 23:11:47,445 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 220 predicate places. [2024-06-27 23:11:47,445 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 486 transitions, 7828 flow [2024-06-27 23:11:47,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:11:47,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:47,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:47,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 23:11:47,446 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:11:47,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:47,446 INFO L85 PathProgramCache]: Analyzing trace with hash -859113572, now seen corresponding path program 2 times [2024-06-27 23:11:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:47,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369236] [2024-06-27 23:11:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:47,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:48,849 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-27 23:11:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369236] [2024-06-27 23:11:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:11:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743771804] [2024-06-27 23:11:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:48,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:11:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:11:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:11:48,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:11:48,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 486 transitions, 7828 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-27 23:11:48,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:48,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:11:48,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:50,099 INFO L124 PetriNetUnfolderBase]: 3697/5717 cut-off events. [2024-06-27 23:11:50,099 INFO L125 PetriNetUnfolderBase]: For 505854/505991 co-relation queries the response was YES. [2024-06-27 23:11:50,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54847 conditions, 5717 events. 3697/5717 cut-off events. For 505854/505991 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 32192 event pairs, 1425 based on Foata normal form. 55/5698 useless extension candidates. Maximal degree in co-relation 54725. Up to 5274 conditions per place. [2024-06-27 23:11:50,168 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 388 selfloop transitions, 31 changer transitions 0/498 dead transitions. [2024-06-27 23:11:50,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 498 transitions, 8824 flow [2024-06-27 23:11:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:11:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:11:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-27 23:11:50,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:11:50,173 INFO L175 Difference]: Start difference. First operand has 263 places, 486 transitions, 7828 flow. Second operand 6 states and 114 transitions. [2024-06-27 23:11:50,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 498 transitions, 8824 flow [2024-06-27 23:11:51,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 498 transitions, 8569 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-27 23:11:51,034 INFO L231 Difference]: Finished difference. Result has 262 places, 486 transitions, 7648 flow [2024-06-27 23:11:51,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7573, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7648, PETRI_PLACES=262, PETRI_TRANSITIONS=486} [2024-06-27 23:11:51,034 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places. [2024-06-27 23:11:51,034 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 486 transitions, 7648 flow [2024-06-27 23:11:51,035 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-27 23:11:51,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:51,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:51,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 23:11:51,035 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-27 23:11:51,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1336487856, now seen corresponding path program 9 times [2024-06-27 23:11:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473959383] [2024-06-27 23:11:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:53,086 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-27 23:11:53,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:53,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473959383] [2024-06-27 23:11:53,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473959383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:53,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:53,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115600658] [2024-06-27 23:11:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:53,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:53,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:53,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:53,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:11:53,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 486 transitions, 7648 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-27 23:11:53,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:53,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:11:53,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:54,766 INFO L124 PetriNetUnfolderBase]: 3749/5783 cut-off events. [2024-06-27 23:11:54,767 INFO L125 PetriNetUnfolderBase]: For 556526/556546 co-relation queries the response was YES. [2024-06-27 23:11:54,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57503 conditions, 5783 events. 3749/5783 cut-off events. For 556526/556546 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 32273 event pairs, 1251 based on Foata normal form. 15/5727 useless extension candidates. Maximal degree in co-relation 57379. Up to 5173 conditions per place. [2024-06-27 23:11:54,837 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 441 selfloop transitions, 77 changer transitions 0/541 dead transitions. [2024-06-27 23:11:54,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 541 transitions, 9745 flow [2024-06-27 23:11:54,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:11:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:11:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-27 23:11:54,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 23:11:54,838 INFO L175 Difference]: Start difference. First operand has 262 places, 486 transitions, 7648 flow. Second operand 10 states and 185 transitions. [2024-06-27 23:11:54,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 541 transitions, 9745 flow [2024-06-27 23:11:55,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 541 transitions, 9699 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 23:11:55,876 INFO L231 Difference]: Finished difference. Result has 269 places, 507 transitions, 8210 flow [2024-06-27 23:11:55,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7602, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8210, PETRI_PLACES=269, PETRI_TRANSITIONS=507} [2024-06-27 23:11:55,876 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 226 predicate places. [2024-06-27 23:11:55,876 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 507 transitions, 8210 flow [2024-06-27 23:11:55,876 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-27 23:11:55,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:11:55,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:11:55,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 23:11:55,877 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-27 23:11:55,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:11:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1336315062, now seen corresponding path program 2 times [2024-06-27 23:11:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:11:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54838769] [2024-06-27 23:11:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:11:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:11:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:11:57,434 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-27 23:11:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:11:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54838769] [2024-06-27 23:11:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54838769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:11:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:11:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:11:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166843637] [2024-06-27 23:11:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:11:57,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:11:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:11:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:11:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:11:57,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:11:57,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 507 transitions, 8210 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:11:57,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:11:57,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:11:57,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:11:58,979 INFO L124 PetriNetUnfolderBase]: 4021/6112 cut-off events. [2024-06-27 23:11:58,979 INFO L125 PetriNetUnfolderBase]: For 573956/573967 co-relation queries the response was YES. [2024-06-27 23:11:59,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59803 conditions, 6112 events. 4021/6112 cut-off events. For 573956/573967 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 33185 event pairs, 1440 based on Foata normal form. 3/6096 useless extension candidates. Maximal degree in co-relation 59677. Up to 5645 conditions per place. [2024-06-27 23:11:59,059 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 449 selfloop transitions, 79 changer transitions 0/537 dead transitions. [2024-06-27 23:11:59,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 537 transitions, 9685 flow [2024-06-27 23:11:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:11:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:11:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-27 23:11:59,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-27 23:11:59,060 INFO L175 Difference]: Start difference. First operand has 269 places, 507 transitions, 8210 flow. Second operand 9 states and 165 transitions. [2024-06-27 23:11:59,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 537 transitions, 9685 flow [2024-06-27 23:12:00,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 537 transitions, 9421 flow, removed 120 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:00,238 INFO L231 Difference]: Finished difference. Result has 273 places, 507 transitions, 8119 flow [2024-06-27 23:12:00,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7950, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8119, PETRI_PLACES=273, PETRI_TRANSITIONS=507} [2024-06-27 23:12:00,239 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 230 predicate places. [2024-06-27 23:12:00,239 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 507 transitions, 8119 flow [2024-06-27 23:12:00,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:12:00,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:00,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:00,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 23:12:00,239 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:00,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash 989814718, now seen corresponding path program 6 times [2024-06-27 23:12:00,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:00,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326705174] [2024-06-27 23:12:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:02,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-27 23:12:02,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:02,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326705174] [2024-06-27 23:12:02,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326705174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:02,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:02,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:12:02,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761530852] [2024-06-27 23:12:02,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:02,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:12:02,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:12:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:12:02,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:12:02,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 507 transitions, 8119 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-27 23:12:02,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:02,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:12:02,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:04,410 INFO L124 PetriNetUnfolderBase]: 3733/5758 cut-off events. [2024-06-27 23:12:04,410 INFO L125 PetriNetUnfolderBase]: For 580768/580789 co-relation queries the response was YES. [2024-06-27 23:12:04,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58227 conditions, 5758 events. 3733/5758 cut-off events. For 580768/580789 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 32126 event pairs, 1259 based on Foata normal form. 12/5699 useless extension candidates. Maximal degree in co-relation 58100. Up to 5277 conditions per place. [2024-06-27 23:12:04,483 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 486 selfloop transitions, 27 changer transitions 0/536 dead transitions. [2024-06-27 23:12:04,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 536 transitions, 9416 flow [2024-06-27 23:12:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:12:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:12:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-27 23:12:04,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-27 23:12:04,485 INFO L175 Difference]: Start difference. First operand has 273 places, 507 transitions, 8119 flow. Second operand 9 states and 165 transitions. [2024-06-27 23:12:04,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 536 transitions, 9416 flow [2024-06-27 23:12:05,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 536 transitions, 9292 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:05,453 INFO L231 Difference]: Finished difference. Result has 277 places, 509 transitions, 8130 flow [2024-06-27 23:12:05,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7995, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8130, PETRI_PLACES=277, PETRI_TRANSITIONS=509} [2024-06-27 23:12:05,454 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 234 predicate places. [2024-06-27 23:12:05,454 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 509 transitions, 8130 flow [2024-06-27 23:12:05,454 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-27 23:12:05,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:05,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:05,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 23:12:05,455 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-27 23:12:05,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:05,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1564389192, now seen corresponding path program 3 times [2024-06-27 23:12:05,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:05,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48625511] [2024-06-27 23:12:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:06,961 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-27 23:12:06,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:06,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48625511] [2024-06-27 23:12:06,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48625511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:06,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:06,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:12:06,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421451801] [2024-06-27 23:12:06,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:06,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:12:06,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:06,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:12:06,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:12:07,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:12:07,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 509 transitions, 8130 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:12:07,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:07,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:12:07,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:08,516 INFO L124 PetriNetUnfolderBase]: 4031/6125 cut-off events. [2024-06-27 23:12:08,516 INFO L125 PetriNetUnfolderBase]: For 585675/585686 co-relation queries the response was YES. [2024-06-27 23:12:08,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59902 conditions, 6125 events. 4031/6125 cut-off events. For 585675/585686 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 33268 event pairs, 1440 based on Foata normal form. 3/6109 useless extension candidates. Maximal degree in co-relation 59774. Up to 5770 conditions per place. [2024-06-27 23:12:08,589 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 488 selfloop transitions, 46 changer transitions 0/543 dead transitions. [2024-06-27 23:12:08,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 543 transitions, 9718 flow [2024-06-27 23:12:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:12:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:12:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 23:12:08,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 23:12:08,591 INFO L175 Difference]: Start difference. First operand has 277 places, 509 transitions, 8130 flow. Second operand 9 states and 162 transitions. [2024-06-27 23:12:08,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 543 transitions, 9718 flow [2024-06-27 23:12:09,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 543 transitions, 9601 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-27 23:12:09,619 INFO L231 Difference]: Finished difference. Result has 279 places, 515 transitions, 8237 flow [2024-06-27 23:12:09,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8013, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8237, PETRI_PLACES=279, PETRI_TRANSITIONS=515} [2024-06-27 23:12:09,620 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places. [2024-06-27 23:12:09,620 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 515 transitions, 8237 flow [2024-06-27 23:12:09,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:12:09,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:09,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:09,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 23:12:09,621 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-27 23:12:09,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1342989920, now seen corresponding path program 2 times [2024-06-27 23:12:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609212140] [2024-06-27 23:12:09,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:11,216 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-27 23:12:11,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609212140] [2024-06-27 23:12:11,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609212140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:11,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:11,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:12:11,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128921891] [2024-06-27 23:12:11,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:11,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:12:11,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:11,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:12:11,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:12:11,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:12:11,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 515 transitions, 8237 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:12:11,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:11,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:12:11,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:12,790 INFO L124 PetriNetUnfolderBase]: 4040/6138 cut-off events. [2024-06-27 23:12:12,790 INFO L125 PetriNetUnfolderBase]: For 599818/599829 co-relation queries the response was YES. [2024-06-27 23:12:12,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60204 conditions, 6138 events. 4040/6138 cut-off events. For 599818/599829 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 33349 event pairs, 1445 based on Foata normal form. 2/6121 useless extension candidates. Maximal degree in co-relation 60075. Up to 5842 conditions per place. [2024-06-27 23:12:12,871 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 511 selfloop transitions, 32 changer transitions 0/552 dead transitions. [2024-06-27 23:12:12,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 552 transitions, 9756 flow [2024-06-27 23:12:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:12:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:12:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 23:12:12,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2024-06-27 23:12:12,872 INFO L175 Difference]: Start difference. First operand has 279 places, 515 transitions, 8237 flow. Second operand 9 states and 160 transitions. [2024-06-27 23:12:12,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 552 transitions, 9756 flow [2024-06-27 23:12:13,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 552 transitions, 9544 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-27 23:12:13,883 INFO L231 Difference]: Finished difference. Result has 281 places, 525 transitions, 8346 flow [2024-06-27 23:12:13,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8036, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8346, PETRI_PLACES=281, PETRI_TRANSITIONS=525} [2024-06-27 23:12:13,884 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places. [2024-06-27 23:12:13,884 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 525 transitions, 8346 flow [2024-06-27 23:12:13,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:12:13,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:13,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:13,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 23:12:13,885 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:13,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:13,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1336310226, now seen corresponding path program 10 times [2024-06-27 23:12:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:13,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576181481] [2024-06-27 23:12:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:15,818 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-27 23:12:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576181481] [2024-06-27 23:12:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576181481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:12:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144167961] [2024-06-27 23:12:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:15,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:12:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:12:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:12:15,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:12:15,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 525 transitions, 8346 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-27 23:12:15,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:15,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:12:15,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:17,684 INFO L124 PetriNetUnfolderBase]: 3790/5847 cut-off events. [2024-06-27 23:12:17,685 INFO L125 PetriNetUnfolderBase]: For 643418/643445 co-relation queries the response was YES. [2024-06-27 23:12:17,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60088 conditions, 5847 events. 3790/5847 cut-off events. For 643418/643445 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32698 event pairs, 1247 based on Foata normal form. 20/5796 useless extension candidates. Maximal degree in co-relation 59958. Up to 5079 conditions per place. [2024-06-27 23:12:17,751 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 436 selfloop transitions, 108 changer transitions 0/567 dead transitions. [2024-06-27 23:12:17,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 567 transitions, 10373 flow [2024-06-27 23:12:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:12:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:12:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-27 23:12:17,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708994708994709 [2024-06-27 23:12:17,753 INFO L175 Difference]: Start difference. First operand has 281 places, 525 transitions, 8346 flow. Second operand 9 states and 178 transitions. [2024-06-27 23:12:17,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 567 transitions, 10373 flow [2024-06-27 23:12:18,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 567 transitions, 10265 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-27 23:12:18,905 INFO L231 Difference]: Finished difference. Result has 283 places, 531 transitions, 8652 flow [2024-06-27 23:12:18,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8238, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8652, PETRI_PLACES=283, PETRI_TRANSITIONS=531} [2024-06-27 23:12:18,906 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places. [2024-06-27 23:12:18,906 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 531 transitions, 8652 flow [2024-06-27 23:12:18,906 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-27 23:12:18,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:18,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:18,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 23:12:18,907 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-27 23:12:18,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash 989819492, now seen corresponding path program 11 times [2024-06-27 23:12:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:18,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329384777] [2024-06-27 23:12:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:20,937 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-27 23:12:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329384777] [2024-06-27 23:12:20,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329384777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:20,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:20,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:12:20,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219263601] [2024-06-27 23:12:20,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:20,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:12:20,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:20,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:12:20,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:12:21,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:12:21,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 531 transitions, 8652 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-27 23:12:21,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:21,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:12:21,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:22,651 INFO L124 PetriNetUnfolderBase]: 3817/5884 cut-off events. [2024-06-27 23:12:22,651 INFO L125 PetriNetUnfolderBase]: For 666489/666516 co-relation queries the response was YES. [2024-06-27 23:12:22,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61373 conditions, 5884 events. 3817/5884 cut-off events. For 666489/666516 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32910 event pairs, 1247 based on Foata normal form. 18/5831 useless extension candidates. Maximal degree in co-relation 61243. Up to 5253 conditions per place. [2024-06-27 23:12:22,723 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 447 selfloop transitions, 94 changer transitions 0/564 dead transitions. [2024-06-27 23:12:22,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 564 transitions, 10274 flow [2024-06-27 23:12:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:12:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:12:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 23:12:22,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 23:12:22,726 INFO L175 Difference]: Start difference. First operand has 283 places, 531 transitions, 8652 flow. Second operand 10 states and 180 transitions. [2024-06-27 23:12:22,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 564 transitions, 10274 flow [2024-06-27 23:12:23,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 564 transitions, 9963 flow, removed 80 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:23,961 INFO L231 Difference]: Finished difference. Result has 288 places, 534 transitions, 8642 flow [2024-06-27 23:12:23,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8367, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8642, PETRI_PLACES=288, PETRI_TRANSITIONS=534} [2024-06-27 23:12:23,962 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 245 predicate places. [2024-06-27 23:12:23,962 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 534 transitions, 8642 flow [2024-06-27 23:12:23,962 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-27 23:12:23,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:23,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:23,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 23:12:23,963 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-27 23:12:23,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1564389006, now seen corresponding path program 12 times [2024-06-27 23:12:23,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:23,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994023660] [2024-06-27 23:12:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:25,754 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-27 23:12:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994023660] [2024-06-27 23:12:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994023660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:25,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:25,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:12:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896994734] [2024-06-27 23:12:25,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:25,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:12:25,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:25,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:12:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:12:25,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:12:25,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 534 transitions, 8642 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-27 23:12:25,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:25,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:12:25,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:27,388 INFO L124 PetriNetUnfolderBase]: 3810/5881 cut-off events. [2024-06-27 23:12:27,388 INFO L125 PetriNetUnfolderBase]: For 678933/678960 co-relation queries the response was YES. [2024-06-27 23:12:27,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61549 conditions, 5881 events. 3810/5881 cut-off events. For 678933/678960 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32965 event pairs, 1249 based on Foata normal form. 20/5830 useless extension candidates. Maximal degree in co-relation 61417. Up to 5268 conditions per place. [2024-06-27 23:12:27,461 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 482 selfloop transitions, 63 changer transitions 0/568 dead transitions. [2024-06-27 23:12:27,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 568 transitions, 10296 flow [2024-06-27 23:12:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:12:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:12:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 23:12:27,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 23:12:27,463 INFO L175 Difference]: Start difference. First operand has 288 places, 534 transitions, 8642 flow. Second operand 9 states and 171 transitions. [2024-06-27 23:12:27,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 568 transitions, 10296 flow [2024-06-27 23:12:28,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 568 transitions, 10057 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-27 23:12:28,741 INFO L231 Difference]: Finished difference. Result has 289 places, 537 transitions, 8615 flow [2024-06-27 23:12:28,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8403, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8615, PETRI_PLACES=289, PETRI_TRANSITIONS=537} [2024-06-27 23:12:28,742 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 246 predicate places. [2024-06-27 23:12:28,742 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 537 transitions, 8615 flow [2024-06-27 23:12:28,742 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-27 23:12:28,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:28,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:28,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 23:12:28,742 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-27 23:12:28,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1557771764, now seen corresponding path program 4 times [2024-06-27 23:12:28,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:28,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617473565] [2024-06-27 23:12:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:30,214 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-27 23:12:30,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:30,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617473565] [2024-06-27 23:12:30,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617473565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:30,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:30,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:12:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610096398] [2024-06-27 23:12:30,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:30,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:12:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:12:30,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:12:30,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:12:30,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 537 transitions, 8615 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:12:30,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:30,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:12:30,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:31,783 INFO L124 PetriNetUnfolderBase]: 4107/6235 cut-off events. [2024-06-27 23:12:31,783 INFO L125 PetriNetUnfolderBase]: For 674020/674031 co-relation queries the response was YES. [2024-06-27 23:12:31,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62741 conditions, 6235 events. 4107/6235 cut-off events. For 674020/674031 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 33939 event pairs, 1437 based on Foata normal form. 3/6219 useless extension candidates. Maximal degree in co-relation 62608. Up to 5872 conditions per place. [2024-06-27 23:12:31,865 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 506 selfloop transitions, 50 changer transitions 0/565 dead transitions. [2024-06-27 23:12:31,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 565 transitions, 9948 flow [2024-06-27 23:12:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:12:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:12:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 23:12:31,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-27 23:12:31,867 INFO L175 Difference]: Start difference. First operand has 289 places, 537 transitions, 8615 flow. Second operand 9 states and 161 transitions. [2024-06-27 23:12:31,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 565 transitions, 9948 flow [2024-06-27 23:12:33,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 565 transitions, 9706 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-27 23:12:33,082 INFO L231 Difference]: Finished difference. Result has 291 places, 537 transitions, 8486 flow [2024-06-27 23:12:33,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8373, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8486, PETRI_PLACES=291, PETRI_TRANSITIONS=537} [2024-06-27 23:12:33,082 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places. [2024-06-27 23:12:33,082 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 537 transitions, 8486 flow [2024-06-27 23:12:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 23:12:33,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:33,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 23:12:33,083 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:33,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:33,083 INFO L85 PathProgramCache]: Analyzing trace with hash -846733412, now seen corresponding path program 3 times [2024-06-27 23:12:33,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:33,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635009666] [2024-06-27 23:12:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:34,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-27 23:12:34,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635009666] [2024-06-27 23:12:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635009666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:34,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:34,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:12:34,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234851014] [2024-06-27 23:12:34,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:34,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:12:34,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:12:34,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:12:34,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:12:34,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 537 transitions, 8486 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-27 23:12:34,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:34,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:12:34,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:35,998 INFO L124 PetriNetUnfolderBase]: 3858/5945 cut-off events. [2024-06-27 23:12:35,999 INFO L125 PetriNetUnfolderBase]: For 667106/667220 co-relation queries the response was YES. [2024-06-27 23:12:36,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59781 conditions, 5945 events. 3858/5945 cut-off events. For 667106/667220 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 33487 event pairs, 1437 based on Foata normal form. 46/5921 useless extension candidates. Maximal degree in co-relation 59647. Up to 5505 conditions per place. [2024-06-27 23:12:36,064 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 448 selfloop transitions, 13 changer transitions 0/545 dead transitions. [2024-06-27 23:12:36,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 545 transitions, 9454 flow [2024-06-27 23:12:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:12:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:12:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-27 23:12:36,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-27 23:12:36,066 INFO L175 Difference]: Start difference. First operand has 291 places, 537 transitions, 8486 flow. Second operand 6 states and 107 transitions. [2024-06-27 23:12:36,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 545 transitions, 9454 flow [2024-06-27 23:12:37,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 545 transitions, 9307 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-27 23:12:37,175 INFO L231 Difference]: Finished difference. Result has 290 places, 537 transitions, 8371 flow [2024-06-27 23:12:37,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8339, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8371, PETRI_PLACES=290, PETRI_TRANSITIONS=537} [2024-06-27 23:12:37,176 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 247 predicate places. [2024-06-27 23:12:37,176 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 537 transitions, 8371 flow [2024-06-27 23:12:37,176 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-27 23:12:37,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:37,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:37,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 23:12:37,176 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-27 23:12:37,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash -853393700, now seen corresponding path program 1 times [2024-06-27 23:12:37,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:37,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264064880] [2024-06-27 23:12:37,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:37,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:38,871 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-27 23:12:38,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:38,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264064880] [2024-06-27 23:12:38,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264064880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:38,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:38,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:12:38,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230035815] [2024-06-27 23:12:38,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:38,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:12:38,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:38,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:12:38,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:12:38,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:12:38,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 537 transitions, 8371 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-27 23:12:38,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:38,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:12:38,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:40,603 INFO L124 PetriNetUnfolderBase]: 4253/6384 cut-off events. [2024-06-27 23:12:40,603 INFO L125 PetriNetUnfolderBase]: For 674135/674135 co-relation queries the response was YES. [2024-06-27 23:12:40,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63149 conditions, 6384 events. 4253/6384 cut-off events. For 674135/674135 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 34071 event pairs, 1531 based on Foata normal form. 1/6384 useless extension candidates. Maximal degree in co-relation 63015. Up to 6263 conditions per place. [2024-06-27 23:12:40,680 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 534 selfloop transitions, 18 changer transitions 0/555 dead transitions. [2024-06-27 23:12:40,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 555 transitions, 9759 flow [2024-06-27 23:12:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:12:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:12:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 23:12:40,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2024-06-27 23:12:40,681 INFO L175 Difference]: Start difference. First operand has 290 places, 537 transitions, 8371 flow. Second operand 6 states and 103 transitions. [2024-06-27 23:12:40,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 555 transitions, 9759 flow [2024-06-27 23:12:42,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 555 transitions, 9705 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 23:12:42,145 INFO L231 Difference]: Finished difference. Result has 291 places, 543 transitions, 8447 flow [2024-06-27 23:12:42,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8317, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8447, PETRI_PLACES=291, PETRI_TRANSITIONS=543} [2024-06-27 23:12:42,146 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places. [2024-06-27 23:12:42,146 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 543 transitions, 8447 flow [2024-06-27 23:12:42,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-27 23:12:42,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:42,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:42,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 23:12:42,146 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-27 23:12:42,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash -359356310, now seen corresponding path program 2 times [2024-06-27 23:12:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85129674] [2024-06-27 23:12:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:44,026 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-27 23:12:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:44,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85129674] [2024-06-27 23:12:44,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85129674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:44,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:44,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:12:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460901670] [2024-06-27 23:12:44,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:44,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:12:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:12:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:12:44,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:12:44,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 543 transitions, 8447 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-27 23:12:44,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:44,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:12:44,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:45,667 INFO L124 PetriNetUnfolderBase]: 4250/6381 cut-off events. [2024-06-27 23:12:45,667 INFO L125 PetriNetUnfolderBase]: For 690954/690957 co-relation queries the response was YES. [2024-06-27 23:12:45,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63678 conditions, 6381 events. 4250/6381 cut-off events. For 690954/690957 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 34062 event pairs, 1534 based on Foata normal form. 3/6382 useless extension candidates. Maximal degree in co-relation 63542. Up to 6260 conditions per place. [2024-06-27 23:12:45,749 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 530 selfloop transitions, 18 changer transitions 0/551 dead transitions. [2024-06-27 23:12:45,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 551 transitions, 9589 flow [2024-06-27 23:12:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:12:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:12:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-27 23:12:45,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-27 23:12:45,751 INFO L175 Difference]: Start difference. First operand has 291 places, 543 transitions, 8447 flow. Second operand 6 states and 99 transitions. [2024-06-27 23:12:45,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 551 transitions, 9589 flow [2024-06-27 23:12:47,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 551 transitions, 9540 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-27 23:12:47,410 INFO L231 Difference]: Finished difference. Result has 295 places, 543 transitions, 8442 flow [2024-06-27 23:12:47,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8398, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8442, PETRI_PLACES=295, PETRI_TRANSITIONS=543} [2024-06-27 23:12:47,410 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 252 predicate places. [2024-06-27 23:12:47,410 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 543 transitions, 8442 flow [2024-06-27 23:12:47,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-27 23:12:47,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:47,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:47,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 23:12:47,411 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:12:47,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:47,411 INFO L85 PathProgramCache]: Analyzing trace with hash -572033420, now seen corresponding path program 3 times [2024-06-27 23:12:47,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:47,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800702371] [2024-06-27 23:12:47,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:49,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-27 23:12:49,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800702371] [2024-06-27 23:12:49,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800702371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:49,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:49,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:12:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668859659] [2024-06-27 23:12:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:49,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:12:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:12:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:12:49,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:12:49,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 543 transitions, 8442 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-27 23:12:49,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:49,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:12:49,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:51,878 INFO L124 PetriNetUnfolderBase]: 3821/5877 cut-off events. [2024-06-27 23:12:51,879 INFO L125 PetriNetUnfolderBase]: For 765606/765647 co-relation queries the response was YES. [2024-06-27 23:12:51,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62059 conditions, 5877 events. 3821/5877 cut-off events. For 765606/765647 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 32688 event pairs, 909 based on Foata normal form. 21/5831 useless extension candidates. Maximal degree in co-relation 61919. Up to 4834 conditions per place. [2024-06-27 23:12:51,958 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 394 selfloop transitions, 168 changer transitions 0/587 dead transitions. [2024-06-27 23:12:51,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 587 transitions, 10214 flow [2024-06-27 23:12:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:12:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:12:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-27 23:12:51,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4623015873015873 [2024-06-27 23:12:51,960 INFO L175 Difference]: Start difference. First operand has 295 places, 543 transitions, 8442 flow. Second operand 12 states and 233 transitions. [2024-06-27 23:12:51,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 587 transitions, 10214 flow [2024-06-27 23:12:53,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 587 transitions, 10150 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-27 23:12:53,510 INFO L231 Difference]: Finished difference. Result has 304 places, 543 transitions, 8722 flow [2024-06-27 23:12:53,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8378, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8722, PETRI_PLACES=304, PETRI_TRANSITIONS=543} [2024-06-27 23:12:53,511 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 261 predicate places. [2024-06-27 23:12:53,511 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 543 transitions, 8722 flow [2024-06-27 23:12:53,511 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-27 23:12:53,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:12:53,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:12:53,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 23:12:53,511 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-27 23:12:53,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:12:53,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1861841558, now seen corresponding path program 4 times [2024-06-27 23:12:53,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:12:53,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116438198] [2024-06-27 23:12:53,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:12:53,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:12:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:12:56,475 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-27 23:12:56,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:12:56,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116438198] [2024-06-27 23:12:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116438198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:12:56,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:12:56,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:12:56,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584484577] [2024-06-27 23:12:56,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:12:56,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:12:56,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:12:56,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:12:56,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:12:56,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:12:56,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 543 transitions, 8722 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:12:56,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:12:56,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:12:56,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:12:58,421 INFO L124 PetriNetUnfolderBase]: 3882/5980 cut-off events. [2024-06-27 23:12:58,421 INFO L125 PetriNetUnfolderBase]: For 824695/824738 co-relation queries the response was YES. [2024-06-27 23:12:58,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63913 conditions, 5980 events. 3882/5980 cut-off events. For 824695/824738 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 33456 event pairs, 928 based on Foata normal form. 37/5944 useless extension candidates. Maximal degree in co-relation 63771. Up to 4781 conditions per place. [2024-06-27 23:12:58,507 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 408 selfloop transitions, 164 changer transitions 0/597 dead transitions. [2024-06-27 23:12:58,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 597 transitions, 10646 flow [2024-06-27 23:12:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:12:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:12:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions. [2024-06-27 23:12:58,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49567099567099565 [2024-06-27 23:12:58,509 INFO L175 Difference]: Start difference. First operand has 304 places, 543 transitions, 8722 flow. Second operand 11 states and 229 transitions. [2024-06-27 23:12:58,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 597 transitions, 10646 flow [2024-06-27 23:13:00,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 597 transitions, 10304 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-27 23:13:00,223 INFO L231 Difference]: Finished difference. Result has 305 places, 544 transitions, 8782 flow [2024-06-27 23:13:00,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8388, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8782, PETRI_PLACES=305, PETRI_TRANSITIONS=544} [2024-06-27 23:13:00,223 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 262 predicate places. [2024-06-27 23:13:00,224 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 544 transitions, 8782 flow [2024-06-27 23:13:00,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:00,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:00,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:00,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 23:13:00,224 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-27 23:13:00,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1861969898, now seen corresponding path program 5 times [2024-06-27 23:13:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:00,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722003541] [2024-06-27 23:13:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:02,997 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-27 23:13:02,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:02,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722003541] [2024-06-27 23:13:02,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722003541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:02,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:02,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864913347] [2024-06-27 23:13:02,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:02,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:03,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:13:03,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 544 transitions, 8782 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:03,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:03,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:13:03,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:05,015 INFO L124 PetriNetUnfolderBase]: 3951/6097 cut-off events. [2024-06-27 23:13:05,015 INFO L125 PetriNetUnfolderBase]: For 852329/852370 co-relation queries the response was YES. [2024-06-27 23:13:05,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65518 conditions, 6097 events. 3951/6097 cut-off events. For 852329/852370 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 34413 event pairs, 895 based on Foata normal form. 37/6061 useless extension candidates. Maximal degree in co-relation 65375. Up to 4706 conditions per place. [2024-06-27 23:13:05,092 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 412 selfloop transitions, 166 changer transitions 0/603 dead transitions. [2024-06-27 23:13:05,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 603 transitions, 10773 flow [2024-06-27 23:13:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:13:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:13:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 233 transitions. [2024-06-27 23:13:05,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043290043290043 [2024-06-27 23:13:05,093 INFO L175 Difference]: Start difference. First operand has 305 places, 544 transitions, 8782 flow. Second operand 11 states and 233 transitions. [2024-06-27 23:13:05,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 603 transitions, 10773 flow [2024-06-27 23:13:06,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 603 transitions, 10431 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-27 23:13:06,944 INFO L231 Difference]: Finished difference. Result has 306 places, 545 transitions, 8837 flow [2024-06-27 23:13:06,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8444, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8837, PETRI_PLACES=306, PETRI_TRANSITIONS=545} [2024-06-27 23:13:06,945 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 263 predicate places. [2024-06-27 23:13:06,945 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 545 transitions, 8837 flow [2024-06-27 23:13:06,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:06,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:06,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:06,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 23:13:06,945 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-27 23:13:06,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1070199810, now seen corresponding path program 6 times [2024-06-27 23:13:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:06,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460158210] [2024-06-27 23:13:06,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:06,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:09,646 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-27 23:13:09,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460158210] [2024-06-27 23:13:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460158210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:09,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:09,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194670385] [2024-06-27 23:13:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:09,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:09,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:13:09,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 545 transitions, 8837 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-27 23:13:09,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:09,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:13:09,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:11,886 INFO L124 PetriNetUnfolderBase]: 4097/6344 cut-off events. [2024-06-27 23:13:11,886 INFO L125 PetriNetUnfolderBase]: For 859770/859797 co-relation queries the response was YES. [2024-06-27 23:13:11,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67729 conditions, 6344 events. 4097/6344 cut-off events. For 859770/859797 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36227 event pairs, 1098 based on Foata normal form. 33/6303 useless extension candidates. Maximal degree in co-relation 67586. Up to 5456 conditions per place. [2024-06-27 23:13:11,970 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 478 selfloop transitions, 108 changer transitions 0/611 dead transitions. [2024-06-27 23:13:11,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 611 transitions, 11293 flow [2024-06-27 23:13:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 23:13:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 23:13:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2024-06-27 23:13:11,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597069597069597 [2024-06-27 23:13:11,972 INFO L175 Difference]: Start difference. First operand has 306 places, 545 transitions, 8837 flow. Second operand 13 states and 251 transitions. [2024-06-27 23:13:11,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 611 transitions, 11293 flow [2024-06-27 23:13:13,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 611 transitions, 10924 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-27 23:13:13,864 INFO L231 Difference]: Finished difference. Result has 311 places, 555 transitions, 8968 flow [2024-06-27 23:13:13,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8486, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8968, PETRI_PLACES=311, PETRI_TRANSITIONS=555} [2024-06-27 23:13:13,865 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 268 predicate places. [2024-06-27 23:13:13,865 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 555 transitions, 8968 flow [2024-06-27 23:13:13,865 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-27 23:13:13,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:13,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:13,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 23:13:13,865 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-27 23:13:13,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash 825191632, now seen corresponding path program 7 times [2024-06-27 23:13:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333751094] [2024-06-27 23:13:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:16,653 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-27 23:13:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:16,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333751094] [2024-06-27 23:13:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333751094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:16,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:16,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766396699] [2024-06-27 23:13:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:16,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:16,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:16,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:16,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:13:16,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 555 transitions, 8968 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:16,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:16,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:13:16,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:18,740 INFO L124 PetriNetUnfolderBase]: 4150/6434 cut-off events. [2024-06-27 23:13:18,741 INFO L125 PetriNetUnfolderBase]: For 884133/884162 co-relation queries the response was YES. [2024-06-27 23:13:18,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68499 conditions, 6434 events. 4150/6434 cut-off events. For 884133/884162 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 36947 event pairs, 1132 based on Foata normal form. 29/6382 useless extension candidates. Maximal degree in co-relation 68354. Up to 5383 conditions per place. [2024-06-27 23:13:18,827 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 450 selfloop transitions, 128 changer transitions 0/603 dead transitions. [2024-06-27 23:13:18,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 603 transitions, 10842 flow [2024-06-27 23:13:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:13:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:13:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2024-06-27 23:13:18,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-27 23:13:18,828 INFO L175 Difference]: Start difference. First operand has 311 places, 555 transitions, 8968 flow. Second operand 10 states and 207 transitions. [2024-06-27 23:13:18,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 603 transitions, 10842 flow [2024-06-27 23:13:21,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 603 transitions, 10634 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 23:13:21,069 INFO L231 Difference]: Finished difference. Result has 313 places, 556 transitions, 9085 flow [2024-06-27 23:13:21,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8760, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9085, PETRI_PLACES=313, PETRI_TRANSITIONS=556} [2024-06-27 23:13:21,070 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 270 predicate places. [2024-06-27 23:13:21,070 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 556 transitions, 9085 flow [2024-06-27 23:13:21,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:21,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:21,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:21,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 23:13:21,071 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-27 23:13:21,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1074796800, now seen corresponding path program 8 times [2024-06-27 23:13:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010770996] [2024-06-27 23:13:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:23,754 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-27 23:13:23,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:23,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010770996] [2024-06-27 23:13:23,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010770996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:23,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:23,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713689501] [2024-06-27 23:13:23,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:23,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:23,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:23,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:13:23,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 556 transitions, 9085 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:23,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:23,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:13:23,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:25,923 INFO L124 PetriNetUnfolderBase]: 4217/6556 cut-off events. [2024-06-27 23:13:25,923 INFO L125 PetriNetUnfolderBase]: For 897438/897465 co-relation queries the response was YES. [2024-06-27 23:13:25,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69750 conditions, 6556 events. 4217/6556 cut-off events. For 897438/897465 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 37876 event pairs, 1053 based on Foata normal form. 29/6518 useless extension candidates. Maximal degree in co-relation 69604. Up to 4976 conditions per place. [2024-06-27 23:13:26,009 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 451 selfloop transitions, 133 changer transitions 0/609 dead transitions. [2024-06-27 23:13:26,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 609 transitions, 11270 flow [2024-06-27 23:13:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:13:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:13:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 211 transitions. [2024-06-27 23:13:26,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023809523809524 [2024-06-27 23:13:26,011 INFO L175 Difference]: Start difference. First operand has 313 places, 556 transitions, 9085 flow. Second operand 10 states and 211 transitions. [2024-06-27 23:13:26,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 609 transitions, 11270 flow [2024-06-27 23:13:27,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 609 transitions, 11001 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 23:13:27,774 INFO L231 Difference]: Finished difference. Result has 315 places, 557 transitions, 9145 flow [2024-06-27 23:13:27,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8816, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9145, PETRI_PLACES=315, PETRI_TRANSITIONS=557} [2024-06-27 23:13:27,775 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 272 predicate places. [2024-06-27 23:13:27,775 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 557 transitions, 9145 flow [2024-06-27 23:13:27,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:27,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:27,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:27,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 23:13:27,776 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-27 23:13:27,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 457124974, now seen corresponding path program 1 times [2024-06-27 23:13:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:27,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629544321] [2024-06-27 23:13:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:30,300 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-27 23:13:30,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:30,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629544321] [2024-06-27 23:13:30,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629544321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:30,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:30,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217897517] [2024-06-27 23:13:30,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:30,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:30,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:30,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:30,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:13:30,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 557 transitions, 9145 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-27 23:13:30,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:30,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:13:30,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:32,520 INFO L124 PetriNetUnfolderBase]: 4573/6995 cut-off events. [2024-06-27 23:13:32,520 INFO L125 PetriNetUnfolderBase]: For 876644/876664 co-relation queries the response was YES. [2024-06-27 23:13:32,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71909 conditions, 6995 events. 4573/6995 cut-off events. For 876644/876664 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 39571 event pairs, 1385 based on Foata normal form. 5/6964 useless extension candidates. Maximal degree in co-relation 71762. Up to 6503 conditions per place. [2024-06-27 23:13:32,617 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 491 selfloop transitions, 107 changer transitions 0/609 dead transitions. [2024-06-27 23:13:32,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 609 transitions, 11166 flow [2024-06-27 23:13:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 23:13:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 23:13:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2024-06-27 23:13:32,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-27 23:13:32,618 INFO L175 Difference]: Start difference. First operand has 315 places, 557 transitions, 9145 flow. Second operand 12 states and 219 transitions. [2024-06-27 23:13:32,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 609 transitions, 11166 flow [2024-06-27 23:13:34,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 609 transitions, 10787 flow, removed 39 selfloop flow, removed 8 redundant places. [2024-06-27 23:13:34,777 INFO L231 Difference]: Finished difference. Result has 320 places, 563 transitions, 9132 flow [2024-06-27 23:13:34,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8774, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9132, PETRI_PLACES=320, PETRI_TRANSITIONS=563} [2024-06-27 23:13:34,777 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 277 predicate places. [2024-06-27 23:13:34,777 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 563 transitions, 9132 flow [2024-06-27 23:13:34,778 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-27 23:13:34,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:34,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:34,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 23:13:34,778 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:13:34,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1501536936, now seen corresponding path program 9 times [2024-06-27 23:13:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143358516] [2024-06-27 23:13:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:37,862 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-27 23:13:37,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:37,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143358516] [2024-06-27 23:13:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143358516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:37,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637068445] [2024-06-27 23:13:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:37,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:37,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:37,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:38,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:13:38,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 563 transitions, 9132 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:38,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:38,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:13:38,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:39,848 INFO L124 PetriNetUnfolderBase]: 4134/6425 cut-off events. [2024-06-27 23:13:39,848 INFO L125 PetriNetUnfolderBase]: For 882856/882883 co-relation queries the response was YES. [2024-06-27 23:13:39,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66431 conditions, 6425 events. 4134/6425 cut-off events. For 882856/882883 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 36995 event pairs, 1117 based on Foata normal form. 37/6389 useless extension candidates. Maximal degree in co-relation 66282. Up to 5326 conditions per place. [2024-06-27 23:13:39,940 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 459 selfloop transitions, 119 changer transitions 0/605 dead transitions. [2024-06-27 23:13:39,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 605 transitions, 10663 flow [2024-06-27 23:13:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:13:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:13:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-27 23:13:39,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 23:13:39,942 INFO L175 Difference]: Start difference. First operand has 320 places, 563 transitions, 9132 flow. Second operand 10 states and 204 transitions. [2024-06-27 23:13:39,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 605 transitions, 10663 flow [2024-06-27 23:13:42,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 605 transitions, 10376 flow, removed 52 selfloop flow, removed 9 redundant places. [2024-06-27 23:13:42,344 INFO L231 Difference]: Finished difference. Result has 322 places, 563 transitions, 9154 flow [2024-06-27 23:13:42,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8845, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9154, PETRI_PLACES=322, PETRI_TRANSITIONS=563} [2024-06-27 23:13:42,345 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2024-06-27 23:13:42,345 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 563 transitions, 9154 flow [2024-06-27 23:13:42,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:42,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:42,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:42,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 23:13:42,345 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-27 23:13:42,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:42,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1835048269, now seen corresponding path program 1 times [2024-06-27 23:13:42,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:42,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454629346] [2024-06-27 23:13:42,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:42,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:44,694 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-27 23:13:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454629346] [2024-06-27 23:13:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454629346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:44,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:13:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445354394] [2024-06-27 23:13:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:44,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:13:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:44,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:13:44,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:13:44,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:13:44,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 563 transitions, 9154 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-27 23:13:44,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:44,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:13:44,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:46,921 INFO L124 PetriNetUnfolderBase]: 4527/6908 cut-off events. [2024-06-27 23:13:46,921 INFO L125 PetriNetUnfolderBase]: For 858679/858698 co-relation queries the response was YES. [2024-06-27 23:13:46,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69783 conditions, 6908 events. 4527/6908 cut-off events. For 858679/858698 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 38728 event pairs, 1441 based on Foata normal form. 6/6882 useless extension candidates. Maximal degree in co-relation 69632. Up to 6386 conditions per place. [2024-06-27 23:13:47,012 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 484 selfloop transitions, 106 changer transitions 0/601 dead transitions. [2024-06-27 23:13:47,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 601 transitions, 10668 flow [2024-06-27 23:13:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:13:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:13:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-27 23:13:47,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-27 23:13:47,014 INFO L175 Difference]: Start difference. First operand has 322 places, 563 transitions, 9154 flow. Second operand 10 states and 188 transitions. [2024-06-27 23:13:47,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 601 transitions, 10668 flow [2024-06-27 23:13:49,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 601 transitions, 10300 flow, removed 10 selfloop flow, removed 12 redundant places. [2024-06-27 23:13:49,049 INFO L231 Difference]: Finished difference. Result has 320 places, 565 transitions, 9078 flow [2024-06-27 23:13:49,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8786, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9078, PETRI_PLACES=320, PETRI_TRANSITIONS=565} [2024-06-27 23:13:49,049 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 277 predicate places. [2024-06-27 23:13:49,050 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 565 transitions, 9078 flow [2024-06-27 23:13:49,050 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-27 23:13:49,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:49,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:49,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 23:13:49,050 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-27 23:13:49,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1835263750, now seen corresponding path program 10 times [2024-06-27 23:13:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:49,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519186178] [2024-06-27 23:13:49,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:52,066 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-27 23:13:52,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519186178] [2024-06-27 23:13:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519186178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:52,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:52,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308613873] [2024-06-27 23:13:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:52,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:52,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:52,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:52,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:13:52,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 565 transitions, 9078 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:52,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:52,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:13:52,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:13:54,247 INFO L124 PetriNetUnfolderBase]: 4253/6615 cut-off events. [2024-06-27 23:13:54,248 INFO L125 PetriNetUnfolderBase]: For 853166/853199 co-relation queries the response was YES. [2024-06-27 23:13:54,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68019 conditions, 6615 events. 4253/6615 cut-off events. For 853166/853199 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 38315 event pairs, 1002 based on Foata normal form. 39/6591 useless extension candidates. Maximal degree in co-relation 67868. Up to 5253 conditions per place. [2024-06-27 23:13:54,333 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 346 selfloop transitions, 242 changer transitions 0/615 dead transitions. [2024-06-27 23:13:54,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 615 transitions, 11062 flow [2024-06-27 23:13:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:13:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:13:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2024-06-27 23:13:54,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 23:13:54,335 INFO L175 Difference]: Start difference. First operand has 320 places, 565 transitions, 9078 flow. Second operand 10 states and 210 transitions. [2024-06-27 23:13:54,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 615 transitions, 11062 flow [2024-06-27 23:13:56,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 615 transitions, 10784 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-27 23:13:56,198 INFO L231 Difference]: Finished difference. Result has 322 places, 566 transitions, 9357 flow [2024-06-27 23:13:56,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8806, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9357, PETRI_PLACES=322, PETRI_TRANSITIONS=566} [2024-06-27 23:13:56,199 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2024-06-27 23:13:56,199 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 566 transitions, 9357 flow [2024-06-27 23:13:56,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:56,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:13:56,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:13:56,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 23:13:56,199 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-27 23:13:56,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:13:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1840626130, now seen corresponding path program 11 times [2024-06-27 23:13:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:13:56,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753952074] [2024-06-27 23:13:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:13:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:13:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:13:59,211 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-27 23:13:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:13:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753952074] [2024-06-27 23:13:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753952074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:13:59,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:13:59,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:13:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317794693] [2024-06-27 23:13:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:13:59,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:13:59,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:13:59,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:13:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:13:59,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:13:59,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 566 transitions, 9357 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:13:59,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:13:59,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:13:59,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:01,494 INFO L124 PetriNetUnfolderBase]: 4327/6749 cut-off events. [2024-06-27 23:14:01,495 INFO L125 PetriNetUnfolderBase]: For 890260/890293 co-relation queries the response was YES. [2024-06-27 23:14:01,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70162 conditions, 6749 events. 4327/6749 cut-off events. For 890260/890293 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 39495 event pairs, 1022 based on Foata normal form. 39/6725 useless extension candidates. Maximal degree in co-relation 70010. Up to 5378 conditions per place. [2024-06-27 23:14:01,580 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 355 selfloop transitions, 234 changer transitions 0/616 dead transitions. [2024-06-27 23:14:01,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 616 transitions, 11343 flow [2024-06-27 23:14:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2024-06-27 23:14:01,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-27 23:14:01,582 INFO L175 Difference]: Start difference. First operand has 322 places, 566 transitions, 9357 flow. Second operand 10 states and 212 transitions. [2024-06-27 23:14:01,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 616 transitions, 11343 flow [2024-06-27 23:14:03,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 616 transitions, 10924 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 23:14:03,676 INFO L231 Difference]: Finished difference. Result has 325 places, 567 transitions, 9475 flow [2024-06-27 23:14:03,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8938, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9475, PETRI_PLACES=325, PETRI_TRANSITIONS=567} [2024-06-27 23:14:03,677 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 282 predicate places. [2024-06-27 23:14:03,677 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 567 transitions, 9475 flow [2024-06-27 23:14:03,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:14:03,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:03,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:03,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 23:14:03,678 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-27 23:14:03,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1840774000, now seen corresponding path program 12 times [2024-06-27 23:14:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:03,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221040785] [2024-06-27 23:14:03,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:07,084 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-27 23:14:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221040785] [2024-06-27 23:14:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221040785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253220122] [2024-06-27 23:14:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:07,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:07,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:07,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:14:07,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 567 transitions, 9475 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:14:07,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:07,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:14:07,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:09,232 INFO L124 PetriNetUnfolderBase]: 4499/7031 cut-off events. [2024-06-27 23:14:09,232 INFO L125 PetriNetUnfolderBase]: For 972486/972520 co-relation queries the response was YES. [2024-06-27 23:14:09,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74831 conditions, 7031 events. 4499/7031 cut-off events. For 972486/972520 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41679 event pairs, 1050 based on Foata normal form. 35/6989 useless extension candidates. Maximal degree in co-relation 74678. Up to 5150 conditions per place. [2024-06-27 23:14:09,331 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 351 selfloop transitions, 243 changer transitions 0/621 dead transitions. [2024-06-27 23:14:09,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 621 transitions, 11803 flow [2024-06-27 23:14:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2024-06-27 23:14:09,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-27 23:14:09,333 INFO L175 Difference]: Start difference. First operand has 325 places, 567 transitions, 9475 flow. Second operand 10 states and 217 transitions. [2024-06-27 23:14:09,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 621 transitions, 11803 flow [2024-06-27 23:14:11,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 621 transitions, 11312 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-27 23:14:11,961 INFO L231 Difference]: Finished difference. Result has 327 places, 569 transitions, 9602 flow [2024-06-27 23:14:11,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8984, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9602, PETRI_PLACES=327, PETRI_TRANSITIONS=569} [2024-06-27 23:14:11,961 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 284 predicate places. [2024-06-27 23:14:11,961 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 569 transitions, 9602 flow [2024-06-27 23:14:11,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:14:11,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:11,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:11,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 23:14:11,962 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-27 23:14:11,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:11,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1840770280, now seen corresponding path program 13 times [2024-06-27 23:14:11,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:11,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648676533] [2024-06-27 23:14:11,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:11,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:14,898 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-27 23:14:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648676533] [2024-06-27 23:14:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648676533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:14,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:14,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263923149] [2024-06-27 23:14:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:14,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:15,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-27 23:14:15,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 569 transitions, 9602 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:14:15,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:15,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-27 23:14:15,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:17,078 INFO L124 PetriNetUnfolderBase]: 4457/6970 cut-off events. [2024-06-27 23:14:17,078 INFO L125 PetriNetUnfolderBase]: For 944832/944866 co-relation queries the response was YES. [2024-06-27 23:14:17,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72894 conditions, 6970 events. 4457/6970 cut-off events. For 944832/944866 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 41340 event pairs, 1064 based on Foata normal form. 35/6929 useless extension candidates. Maximal degree in co-relation 72740. Up to 5498 conditions per place. [2024-06-27 23:14:17,175 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 343 selfloop transitions, 246 changer transitions 0/616 dead transitions. [2024-06-27 23:14:17,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 616 transitions, 11510 flow [2024-06-27 23:14:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-06-27 23:14:17,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2024-06-27 23:14:17,176 INFO L175 Difference]: Start difference. First operand has 327 places, 569 transitions, 9602 flow. Second operand 10 states and 214 transitions. [2024-06-27 23:14:17,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 616 transitions, 11510 flow [2024-06-27 23:14:19,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 616 transitions, 11166 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-27 23:14:19,374 INFO L231 Difference]: Finished difference. Result has 331 places, 569 transitions, 9757 flow [2024-06-27 23:14:19,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9258, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9757, PETRI_PLACES=331, PETRI_TRANSITIONS=569} [2024-06-27 23:14:19,375 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 288 predicate places. [2024-06-27 23:14:19,375 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 569 transitions, 9757 flow [2024-06-27 23:14:19,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 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-27 23:14:19,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:19,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:19,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 23:14:19,375 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:19,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1550580303, now seen corresponding path program 2 times [2024-06-27 23:14:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:19,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336083704] [2024-06-27 23:14:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:19,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:21,319 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-27 23:14:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:21,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336083704] [2024-06-27 23:14:21,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336083704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:21,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:21,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:14:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403192238] [2024-06-27 23:14:21,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:21,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:14:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:21,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:14:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:14:21,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:14:21,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 569 transitions, 9757 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-27 23:14:21,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:21,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:14:21,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:23,363 INFO L124 PetriNetUnfolderBase]: 4604/7191 cut-off events. [2024-06-27 23:14:23,363 INFO L125 PetriNetUnfolderBase]: For 859409/859456 co-relation queries the response was YES. [2024-06-27 23:14:23,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72757 conditions, 7191 events. 4604/7191 cut-off events. For 859409/859456 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 42645 event pairs, 1241 based on Foata normal form. 33/7179 useless extension candidates. Maximal degree in co-relation 72601. Up to 6617 conditions per place. [2024-06-27 23:14:23,469 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 448 selfloop transitions, 59 changer transitions 0/594 dead transitions. [2024-06-27 23:14:23,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 594 transitions, 11074 flow [2024-06-27 23:14:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:14:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:14:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 23:14:23,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-27 23:14:23,470 INFO L175 Difference]: Start difference. First operand has 331 places, 569 transitions, 9757 flow. Second operand 8 states and 149 transitions. [2024-06-27 23:14:23,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 594 transitions, 11074 flow [2024-06-27 23:14:26,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 594 transitions, 10567 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-27 23:14:26,503 INFO L231 Difference]: Finished difference. Result has 330 places, 575 transitions, 9441 flow [2024-06-27 23:14:26,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9250, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9441, PETRI_PLACES=330, PETRI_TRANSITIONS=575} [2024-06-27 23:14:26,504 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 287 predicate places. [2024-06-27 23:14:26,504 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 575 transitions, 9441 flow [2024-06-27 23:14:26,504 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-27 23:14:26,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:26,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:26,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 23:14:26,505 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:26,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:26,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2080060875, now seen corresponding path program 2 times [2024-06-27 23:14:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651727868] [2024-06-27 23:14:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:28,761 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-27 23:14:28,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:28,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651727868] [2024-06-27 23:14:28,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651727868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:28,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:28,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:28,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699987918] [2024-06-27 23:14:28,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:28,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:28,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:28,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:14:28,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 575 transitions, 9441 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-27 23:14:28,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:28,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:14:28,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:30,838 INFO L124 PetriNetUnfolderBase]: 4905/7557 cut-off events. [2024-06-27 23:14:30,838 INFO L125 PetriNetUnfolderBase]: For 917636/917654 co-relation queries the response was YES. [2024-06-27 23:14:30,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75786 conditions, 7557 events. 4905/7557 cut-off events. For 917636/917654 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 44026 event pairs, 1976 based on Foata normal form. 4/7524 useless extension candidates. Maximal degree in co-relation 75629. Up to 7084 conditions per place. [2024-06-27 23:14:30,942 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 509 selfloop transitions, 91 changer transitions 0/611 dead transitions. [2024-06-27 23:14:30,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 611 transitions, 10911 flow [2024-06-27 23:14:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 23:14:30,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 23:14:30,943 INFO L175 Difference]: Start difference. First operand has 330 places, 575 transitions, 9441 flow. Second operand 10 states and 180 transitions. [2024-06-27 23:14:30,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 611 transitions, 10911 flow [2024-06-27 23:14:33,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 611 transitions, 10798 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 23:14:33,429 INFO L231 Difference]: Finished difference. Result has 337 places, 580 transitions, 9634 flow [2024-06-27 23:14:33,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9328, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9634, PETRI_PLACES=337, PETRI_TRANSITIONS=580} [2024-06-27 23:14:33,430 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 294 predicate places. [2024-06-27 23:14:33,430 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 580 transitions, 9634 flow [2024-06-27 23:14:33,430 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-27 23:14:33,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:33,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:33,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 23:14:33,430 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-27 23:14:33,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1686110377, now seen corresponding path program 3 times [2024-06-27 23:14:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:33,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134186888] [2024-06-27 23:14:33,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:35,160 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-27 23:14:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134186888] [2024-06-27 23:14:35,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134186888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:35,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:35,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:35,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095968821] [2024-06-27 23:14:35,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:35,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:35,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:35,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:35,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:35,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:14:35,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 580 transitions, 9634 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-27 23:14:35,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:35,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:14:35,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:37,667 INFO L124 PetriNetUnfolderBase]: 4922/7576 cut-off events. [2024-06-27 23:14:37,667 INFO L125 PetriNetUnfolderBase]: For 943203/943220 co-relation queries the response was YES. [2024-06-27 23:14:37,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76706 conditions, 7576 events. 4922/7576 cut-off events. For 943203/943220 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 43965 event pairs, 2016 based on Foata normal form. 4/7546 useless extension candidates. Maximal degree in co-relation 76546. Up to 7263 conditions per place. [2024-06-27 23:14:37,756 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 578 selfloop transitions, 24 changer transitions 0/613 dead transitions. [2024-06-27 23:14:37,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 613 transitions, 11154 flow [2024-06-27 23:14:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:14:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:14:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-06-27 23:14:37,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2024-06-27 23:14:37,758 INFO L175 Difference]: Start difference. First operand has 337 places, 580 transitions, 9634 flow. Second operand 11 states and 183 transitions. [2024-06-27 23:14:37,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 613 transitions, 11154 flow [2024-06-27 23:14:40,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 613 transitions, 10780 flow, removed 50 selfloop flow, removed 9 redundant places. [2024-06-27 23:14:40,277 INFO L231 Difference]: Finished difference. Result has 339 places, 582 transitions, 9401 flow [2024-06-27 23:14:40,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9260, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9401, PETRI_PLACES=339, PETRI_TRANSITIONS=582} [2024-06-27 23:14:40,277 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 296 predicate places. [2024-06-27 23:14:40,277 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 582 transitions, 9401 flow [2024-06-27 23:14:40,278 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-27 23:14:40,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:40,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:40,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 23:14:40,278 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:40,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:40,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1682554578, now seen corresponding path program 2 times [2024-06-27 23:14:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906407449] [2024-06-27 23:14:40,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:42,118 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-27 23:14:42,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:42,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906407449] [2024-06-27 23:14:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906407449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:42,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:42,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454249466] [2024-06-27 23:14:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:42,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:42,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:42,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:42,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:42,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:14:42,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 582 transitions, 9401 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-27 23:14:42,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:42,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:14:42,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:44,331 INFO L124 PetriNetUnfolderBase]: 4949/7613 cut-off events. [2024-06-27 23:14:44,332 INFO L125 PetriNetUnfolderBase]: For 965226/965245 co-relation queries the response was YES. [2024-06-27 23:14:44,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77204 conditions, 7613 events. 4949/7613 cut-off events. For 965226/965245 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 44190 event pairs, 2023 based on Foata normal form. 2/7581 useless extension candidates. Maximal degree in co-relation 77044. Up to 7177 conditions per place. [2024-06-27 23:14:44,438 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 554 selfloop transitions, 54 changer transitions 0/619 dead transitions. [2024-06-27 23:14:44,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 619 transitions, 11317 flow [2024-06-27 23:14:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-27 23:14:44,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-27 23:14:44,440 INFO L175 Difference]: Start difference. First operand has 339 places, 582 transitions, 9401 flow. Second operand 10 states and 174 transitions. [2024-06-27 23:14:44,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 619 transitions, 11317 flow [2024-06-27 23:14:47,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 619 transitions, 11163 flow, removed 39 selfloop flow, removed 12 redundant places. [2024-06-27 23:14:47,073 INFO L231 Difference]: Finished difference. Result has 337 places, 588 transitions, 9533 flow [2024-06-27 23:14:47,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9247, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9533, PETRI_PLACES=337, PETRI_TRANSITIONS=588} [2024-06-27 23:14:47,074 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 294 predicate places. [2024-06-27 23:14:47,074 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 588 transitions, 9533 flow [2024-06-27 23:14:47,074 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-27 23:14:47,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:47,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:47,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 23:14:47,074 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-27 23:14:47,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1523904936, now seen corresponding path program 3 times [2024-06-27 23:14:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148632883] [2024-06-27 23:14:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:47,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:49,139 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-27 23:14:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148632883] [2024-06-27 23:14:49,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148632883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:49,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:49,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273713396] [2024-06-27 23:14:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:49,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:49,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:49,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:14:49,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 588 transitions, 9533 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-27 23:14:49,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:49,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:14:49,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:51,537 INFO L124 PetriNetUnfolderBase]: 4960/7629 cut-off events. [2024-06-27 23:14:51,538 INFO L125 PetriNetUnfolderBase]: For 986334/986353 co-relation queries the response was YES. [2024-06-27 23:14:51,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77623 conditions, 7629 events. 4960/7629 cut-off events. For 986334/986353 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 44307 event pairs, 2012 based on Foata normal form. 2/7597 useless extension candidates. Maximal degree in co-relation 77463. Up to 7028 conditions per place. [2024-06-27 23:14:51,644 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 514 selfloop transitions, 99 changer transitions 0/624 dead transitions. [2024-06-27 23:14:51,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 624 transitions, 11413 flow [2024-06-27 23:14:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:14:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:14:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 23:14:51,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-27 23:14:51,646 INFO L175 Difference]: Start difference. First operand has 337 places, 588 transitions, 9533 flow. Second operand 10 states and 177 transitions. [2024-06-27 23:14:51,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 624 transitions, 11413 flow [2024-06-27 23:14:54,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 624 transitions, 11279 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-27 23:14:54,391 INFO L231 Difference]: Finished difference. Result has 340 places, 591 transitions, 9699 flow [2024-06-27 23:14:54,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9403, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9699, PETRI_PLACES=340, PETRI_TRANSITIONS=591} [2024-06-27 23:14:54,391 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 297 predicate places. [2024-06-27 23:14:54,392 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 591 transitions, 9699 flow [2024-06-27 23:14:54,392 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-27 23:14:54,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:14:54,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:14:54,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 23:14:54,392 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:14:54,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:14:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -643294194, now seen corresponding path program 4 times [2024-06-27 23:14:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:14:54,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988683686] [2024-06-27 23:14:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:14:54,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:14:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:14:56,357 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-27 23:14:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:14:56,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988683686] [2024-06-27 23:14:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988683686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:14:56,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:14:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:14:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578136760] [2024-06-27 23:14:56,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:14:56,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:14:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:14:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:14:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:14:56,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:14:56,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 591 transitions, 9699 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-27 23:14:56,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:14:56,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:14:56,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:14:58,646 INFO L124 PetriNetUnfolderBase]: 5017/7713 cut-off events. [2024-06-27 23:14:58,646 INFO L125 PetriNetUnfolderBase]: For 987492/987511 co-relation queries the response was YES. [2024-06-27 23:14:58,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78573 conditions, 7713 events. 5017/7713 cut-off events. For 987492/987511 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 44880 event pairs, 2030 based on Foata normal form. 2/7681 useless extension candidates. Maximal degree in co-relation 78412. Up to 7355 conditions per place. [2024-06-27 23:14:58,776 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 588 selfloop transitions, 43 changer transitions 0/642 dead transitions. [2024-06-27 23:14:58,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 642 transitions, 11580 flow [2024-06-27 23:14:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:14:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:14:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 23:14:58,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 23:14:58,778 INFO L175 Difference]: Start difference. First operand has 340 places, 591 transitions, 9699 flow. Second operand 9 states and 162 transitions. [2024-06-27 23:14:58,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 642 transitions, 11580 flow [2024-06-27 23:15:02,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 642 transitions, 11101 flow, removed 42 selfloop flow, removed 10 redundant places. [2024-06-27 23:15:02,657 INFO L231 Difference]: Finished difference. Result has 340 places, 611 transitions, 9756 flow [2024-06-27 23:15:02,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9280, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9756, PETRI_PLACES=340, PETRI_TRANSITIONS=611} [2024-06-27 23:15:02,658 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 297 predicate places. [2024-06-27 23:15:02,658 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 611 transitions, 9756 flow [2024-06-27 23:15:02,659 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-27 23:15:02,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:02,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:02,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 23:15:02,659 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-27 23:15:02,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1251419846, now seen corresponding path program 14 times [2024-06-27 23:15:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:02,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198923055] [2024-06-27 23:15:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:04,841 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-27 23:15:04,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198923055] [2024-06-27 23:15:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198923055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:04,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:04,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739722242] [2024-06-27 23:15:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:04,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:04,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:04,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:04,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:05,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:05,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 611 transitions, 9756 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-27 23:15:05,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:05,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:07,304 INFO L124 PetriNetUnfolderBase]: 4672/7336 cut-off events. [2024-06-27 23:15:07,304 INFO L125 PetriNetUnfolderBase]: For 1064288/1064315 co-relation queries the response was YES. [2024-06-27 23:15:07,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77384 conditions, 7336 events. 4672/7336 cut-off events. For 1064288/1064315 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 44314 event pairs, 1757 based on Foata normal form. 25/7271 useless extension candidates. Maximal degree in co-relation 77222. Up to 6524 conditions per place. [2024-06-27 23:15:07,421 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 553 selfloop transitions, 72 changer transitions 0/652 dead transitions. [2024-06-27 23:15:07,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 652 transitions, 11736 flow [2024-06-27 23:15:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-27 23:15:07,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-27 23:15:07,423 INFO L175 Difference]: Start difference. First operand has 340 places, 611 transitions, 9756 flow. Second operand 10 states and 191 transitions. [2024-06-27 23:15:07,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 652 transitions, 11736 flow [2024-06-27 23:15:10,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 652 transitions, 11656 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 23:15:10,502 INFO L231 Difference]: Finished difference. Result has 344 places, 612 transitions, 9897 flow [2024-06-27 23:15:10,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9676, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9897, PETRI_PLACES=344, PETRI_TRANSITIONS=612} [2024-06-27 23:15:10,502 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 301 predicate places. [2024-06-27 23:15:10,503 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 612 transitions, 9897 flow [2024-06-27 23:15:10,503 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-27 23:15:10,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:10,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:10,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 23:15:10,503 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-27 23:15:10,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1524058758, now seen corresponding path program 15 times [2024-06-27 23:15:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:10,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012993663] [2024-06-27 23:15:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:13,248 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-27 23:15:13,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:13,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012993663] [2024-06-27 23:15:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012993663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:13,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:13,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673283285] [2024-06-27 23:15:13,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:13,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:13,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:13,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 612 transitions, 9897 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-27 23:15:13,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:13,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:13,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:15,945 INFO L124 PetriNetUnfolderBase]: 4983/7838 cut-off events. [2024-06-27 23:15:15,945 INFO L125 PetriNetUnfolderBase]: For 1184207/1184234 co-relation queries the response was YES. [2024-06-27 23:15:16,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85047 conditions, 7838 events. 4983/7838 cut-off events. For 1184207/1184234 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 48100 event pairs, 1784 based on Foata normal form. 25/7769 useless extension candidates. Maximal degree in co-relation 84884. Up to 6402 conditions per place. [2024-06-27 23:15:16,056 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 518 selfloop transitions, 132 changer transitions 0/677 dead transitions. [2024-06-27 23:15:16,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 677 transitions, 12720 flow [2024-06-27 23:15:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-27 23:15:16,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738095238095238 [2024-06-27 23:15:16,058 INFO L175 Difference]: Start difference. First operand has 344 places, 612 transitions, 9897 flow. Second operand 10 states and 199 transitions. [2024-06-27 23:15:16,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 677 transitions, 12720 flow [2024-06-27 23:15:19,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 677 transitions, 12506 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-27 23:15:19,287 INFO L231 Difference]: Finished difference. Result has 348 places, 627 transitions, 10537 flow [2024-06-27 23:15:19,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9722, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10537, PETRI_PLACES=348, PETRI_TRANSITIONS=627} [2024-06-27 23:15:19,288 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 305 predicate places. [2024-06-27 23:15:19,288 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 627 transitions, 10537 flow [2024-06-27 23:15:19,288 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-27 23:15:19,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:19,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:19,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 23:15:19,288 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-27 23:15:19,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash -892377954, now seen corresponding path program 5 times [2024-06-27 23:15:19,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:19,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326647524] [2024-06-27 23:15:19,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:19,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:21,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-27 23:15:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326647524] [2024-06-27 23:15:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326647524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:21,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728675013] [2024-06-27 23:15:21,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:21,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:21,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:21,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:21,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:15:21,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 627 transitions, 10537 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-27 23:15:21,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:21,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:15:21,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:23,606 INFO L124 PetriNetUnfolderBase]: 5415/8359 cut-off events. [2024-06-27 23:15:23,606 INFO L125 PetriNetUnfolderBase]: For 1139123/1139142 co-relation queries the response was YES. [2024-06-27 23:15:23,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88169 conditions, 8359 events. 5415/8359 cut-off events. For 1139123/1139142 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49729 event pairs, 2118 based on Foata normal form. 2/8327 useless extension candidates. Maximal degree in co-relation 88003. Up to 7969 conditions per place. [2024-06-27 23:15:23,747 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 598 selfloop transitions, 54 changer transitions 0/663 dead transitions. [2024-06-27 23:15:23,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 663 transitions, 12156 flow [2024-06-27 23:15:23,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:15:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:15:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-27 23:15:23,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-27 23:15:23,749 INFO L175 Difference]: Start difference. First operand has 348 places, 627 transitions, 10537 flow. Second operand 11 states and 187 transitions. [2024-06-27 23:15:23,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 663 transitions, 12156 flow [2024-06-27 23:15:27,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 663 transitions, 11926 flow, removed 56 selfloop flow, removed 5 redundant places. [2024-06-27 23:15:27,558 INFO L231 Difference]: Finished difference. Result has 354 places, 627 transitions, 10446 flow [2024-06-27 23:15:27,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10309, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10446, PETRI_PLACES=354, PETRI_TRANSITIONS=627} [2024-06-27 23:15:27,559 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 311 predicate places. [2024-06-27 23:15:27,559 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 627 transitions, 10446 flow [2024-06-27 23:15:27,559 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-27 23:15:27,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:27,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:27,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 23:15:27,559 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-27 23:15:27,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1524055038, now seen corresponding path program 16 times [2024-06-27 23:15:27,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:27,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156412917] [2024-06-27 23:15:27,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:27,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:30,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-27 23:15:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156412917] [2024-06-27 23:15:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156412917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:30,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:30,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:30,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773167565] [2024-06-27 23:15:30,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:30,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:30,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:30,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:15:30,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 627 transitions, 10446 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-27 23:15:30,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:30,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:15:30,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:33,003 INFO L124 PetriNetUnfolderBase]: 5052/7948 cut-off events. [2024-06-27 23:15:33,003 INFO L125 PetriNetUnfolderBase]: For 1228368/1228395 co-relation queries the response was YES. [2024-06-27 23:15:33,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86497 conditions, 7948 events. 5052/7948 cut-off events. For 1228368/1228395 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 48852 event pairs, 1810 based on Foata normal form. 25/7883 useless extension candidates. Maximal degree in co-relation 86329. Up to 6984 conditions per place. [2024-06-27 23:15:33,134 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 519 selfloop transitions, 125 changer transitions 0/671 dead transitions. [2024-06-27 23:15:33,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 671 transitions, 12528 flow [2024-06-27 23:15:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-06-27 23:15:33,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 23:15:33,136 INFO L175 Difference]: Start difference. First operand has 354 places, 627 transitions, 10446 flow. Second operand 10 states and 196 transitions. [2024-06-27 23:15:33,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 671 transitions, 12528 flow [2024-06-27 23:15:37,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 671 transitions, 12445 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 23:15:37,311 INFO L231 Difference]: Finished difference. Result has 355 places, 628 transitions, 10687 flow [2024-06-27 23:15:37,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10363, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10687, PETRI_PLACES=355, PETRI_TRANSITIONS=628} [2024-06-27 23:15:37,311 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 312 predicate places. [2024-06-27 23:15:37,312 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 628 transitions, 10687 flow [2024-06-27 23:15:37,312 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-27 23:15:37,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:37,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:37,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 23:15:37,312 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:37,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1508135837, now seen corresponding path program 4 times [2024-06-27 23:15:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:37,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376160406] [2024-06-27 23:15:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:39,222 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-27 23:15:39,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376160406] [2024-06-27 23:15:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376160406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:15:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913858364] [2024-06-27 23:15:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:39,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:15:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:15:39,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:15:39,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:15:39,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 628 transitions, 10687 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-27 23:15:39,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:39,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:15:39,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:41,766 INFO L124 PetriNetUnfolderBase]: 5524/8539 cut-off events. [2024-06-27 23:15:41,766 INFO L125 PetriNetUnfolderBase]: For 1197180/1197199 co-relation queries the response was YES. [2024-06-27 23:15:41,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90566 conditions, 8539 events. 5524/8539 cut-off events. For 1197180/1197199 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 51215 event pairs, 2125 based on Foata normal form. 4/8509 useless extension candidates. Maximal degree in co-relation 90397. Up to 8215 conditions per place. [2024-06-27 23:15:41,894 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 616 selfloop transitions, 31 changer transitions 0/658 dead transitions. [2024-06-27 23:15:41,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 658 transitions, 12268 flow [2024-06-27 23:15:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 23:15:41,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4023809523809524 [2024-06-27 23:15:41,896 INFO L175 Difference]: Start difference. First operand has 355 places, 628 transitions, 10687 flow. Second operand 10 states and 169 transitions. [2024-06-27 23:15:41,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 658 transitions, 12268 flow [2024-06-27 23:15:46,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 658 transitions, 12030 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 23:15:46,434 INFO L231 Difference]: Finished difference. Result has 358 places, 630 transitions, 10613 flow [2024-06-27 23:15:46,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10449, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10613, PETRI_PLACES=358, PETRI_TRANSITIONS=630} [2024-06-27 23:15:46,435 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 315 predicate places. [2024-06-27 23:15:46,435 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 630 transitions, 10613 flow [2024-06-27 23:15:46,435 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-27 23:15:46,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:46,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:46,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 23:15:46,436 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:46,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1517332607, now seen corresponding path program 5 times [2024-06-27 23:15:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972695459] [2024-06-27 23:15:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:48,227 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-27 23:15:48,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972695459] [2024-06-27 23:15:48,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972695459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:48,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:48,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203221693] [2024-06-27 23:15:48,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:48,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:48,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:48,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:48,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:48,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:15:48,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 630 transitions, 10613 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-27 23:15:48,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:48,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:15:48,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:15:50,974 INFO L124 PetriNetUnfolderBase]: 5541/8566 cut-off events. [2024-06-27 23:15:50,975 INFO L125 PetriNetUnfolderBase]: For 1218168/1218189 co-relation queries the response was YES. [2024-06-27 23:15:51,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90772 conditions, 8566 events. 5541/8566 cut-off events. For 1218168/1218189 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 51354 event pairs, 2144 based on Foata normal form. 4/8536 useless extension candidates. Maximal degree in co-relation 90602. Up to 8244 conditions per place. [2024-06-27 23:15:51,107 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 619 selfloop transitions, 34 changer transitions 0/664 dead transitions. [2024-06-27 23:15:51,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 664 transitions, 12265 flow [2024-06-27 23:15:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:15:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:15:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-27 23:15:51,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-06-27 23:15:51,109 INFO L175 Difference]: Start difference. First operand has 358 places, 630 transitions, 10613 flow. Second operand 10 states and 176 transitions. [2024-06-27 23:15:51,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 664 transitions, 12265 flow [2024-06-27 23:15:55,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 664 transitions, 12121 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-27 23:15:55,421 INFO L231 Difference]: Finished difference. Result has 360 places, 632 transitions, 10642 flow [2024-06-27 23:15:55,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10469, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10642, PETRI_PLACES=360, PETRI_TRANSITIONS=632} [2024-06-27 23:15:55,422 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 317 predicate places. [2024-06-27 23:15:55,422 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 632 transitions, 10642 flow [2024-06-27 23:15:55,422 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-27 23:15:55,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:15:55,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:15:55,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 23:15:55,422 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:15:55,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:15:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1251627608, now seen corresponding path program 6 times [2024-06-27 23:15:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:15:55,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017511483] [2024-06-27 23:15:55,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:15:55,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:15:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:15:57,588 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-27 23:15:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:15:57,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017511483] [2024-06-27 23:15:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017511483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:15:57,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:15:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:15:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27484678] [2024-06-27 23:15:57,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:15:57,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:15:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:15:57,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:15:57,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:15:57,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:15:57,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 632 transitions, 10642 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-27 23:15:57,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:15:57,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:15:57,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:00,151 INFO L124 PetriNetUnfolderBase]: 5552/8576 cut-off events. [2024-06-27 23:16:00,151 INFO L125 PetriNetUnfolderBase]: For 1231582/1231605 co-relation queries the response was YES. [2024-06-27 23:16:00,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90909 conditions, 8576 events. 5552/8576 cut-off events. For 1231582/1231605 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 51420 event pairs, 2115 based on Foata normal form. 4/8546 useless extension candidates. Maximal degree in co-relation 90738. Up to 8092 conditions per place. [2024-06-27 23:16:00,287 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 581 selfloop transitions, 81 changer transitions 0/673 dead transitions. [2024-06-27 23:16:00,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 673 transitions, 12420 flow [2024-06-27 23:16:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-27 23:16:00,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119047619047619 [2024-06-27 23:16:00,288 INFO L175 Difference]: Start difference. First operand has 360 places, 632 transitions, 10642 flow. Second operand 10 states and 173 transitions. [2024-06-27 23:16:00,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 673 transitions, 12420 flow [2024-06-27 23:16:04,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 673 transitions, 12231 flow, removed 69 selfloop flow, removed 7 redundant places. [2024-06-27 23:16:04,470 INFO L231 Difference]: Finished difference. Result has 364 places, 640 transitions, 10803 flow [2024-06-27 23:16:04,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10453, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10803, PETRI_PLACES=364, PETRI_TRANSITIONS=640} [2024-06-27 23:16:04,471 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 321 predicate places. [2024-06-27 23:16:04,471 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 640 transitions, 10803 flow [2024-06-27 23:16:04,471 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-27 23:16:04,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:04,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:04,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 23:16:04,471 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:04,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1251635327, now seen corresponding path program 6 times [2024-06-27 23:16:04,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045127228] [2024-06-27 23:16:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:06,446 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-27 23:16:06,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:06,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045127228] [2024-06-27 23:16:06,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045127228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:06,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:06,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690643051] [2024-06-27 23:16:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:06,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:06,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:06,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:16:06,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 640 transitions, 10803 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-27 23:16:06,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:06,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:16:06,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:09,188 INFO L124 PetriNetUnfolderBase]: 5580/8626 cut-off events. [2024-06-27 23:16:09,188 INFO L125 PetriNetUnfolderBase]: For 1259387/1259410 co-relation queries the response was YES. [2024-06-27 23:16:09,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91630 conditions, 8626 events. 5580/8626 cut-off events. For 1259387/1259410 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51851 event pairs, 2122 based on Foata normal form. 4/8596 useless extension candidates. Maximal degree in co-relation 91457. Up to 8251 conditions per place. [2024-06-27 23:16:09,331 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 613 selfloop transitions, 49 changer transitions 0/673 dead transitions. [2024-06-27 23:16:09,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 673 transitions, 12445 flow [2024-06-27 23:16:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 23:16:09,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-27 23:16:09,332 INFO L175 Difference]: Start difference. First operand has 364 places, 640 transitions, 10803 flow. Second operand 10 states and 170 transitions. [2024-06-27 23:16:09,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 673 transitions, 12445 flow [2024-06-27 23:16:13,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 673 transitions, 12344 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 23:16:13,600 INFO L231 Difference]: Finished difference. Result has 367 places, 644 transitions, 10925 flow [2024-06-27 23:16:13,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10702, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10925, PETRI_PLACES=367, PETRI_TRANSITIONS=644} [2024-06-27 23:16:13,601 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 324 predicate places. [2024-06-27 23:16:13,601 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 644 transitions, 10925 flow [2024-06-27 23:16:13,601 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-27 23:16:13,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:13,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:13,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 23:16:13,602 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:13,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1518340746, now seen corresponding path program 7 times [2024-06-27 23:16:13,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:13,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520525548] [2024-06-27 23:16:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:15,906 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-27 23:16:15,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:15,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520525548] [2024-06-27 23:16:15,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520525548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:15,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:15,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389538718] [2024-06-27 23:16:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:15,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:15,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:15,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:16,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:16:16,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 644 transitions, 10925 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-27 23:16:16,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:16,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:16:16,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:18,783 INFO L124 PetriNetUnfolderBase]: 5604/8656 cut-off events. [2024-06-27 23:16:18,783 INFO L125 PetriNetUnfolderBase]: For 1254599/1254624 co-relation queries the response was YES. [2024-06-27 23:16:18,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91957 conditions, 8656 events. 5604/8656 cut-off events. For 1254599/1254624 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 51926 event pairs, 2124 based on Foata normal form. 4/8626 useless extension candidates. Maximal degree in co-relation 91784. Up to 7984 conditions per place. [2024-06-27 23:16:18,902 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 552 selfloop transitions, 128 changer transitions 0/691 dead transitions. [2024-06-27 23:16:18,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 691 transitions, 13128 flow [2024-06-27 23:16:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-27 23:16:18,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-27 23:16:18,904 INFO L175 Difference]: Start difference. First operand has 367 places, 644 transitions, 10925 flow. Second operand 10 states and 178 transitions. [2024-06-27 23:16:18,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 691 transitions, 13128 flow [2024-06-27 23:16:23,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 691 transitions, 12889 flow, removed 46 selfloop flow, removed 9 redundant places. [2024-06-27 23:16:23,012 INFO L231 Difference]: Finished difference. Result has 368 places, 651 transitions, 11099 flow [2024-06-27 23:16:23,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10686, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11099, PETRI_PLACES=368, PETRI_TRANSITIONS=651} [2024-06-27 23:16:23,012 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 325 predicate places. [2024-06-27 23:16:23,012 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 651 transitions, 11099 flow [2024-06-27 23:16:23,013 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-27 23:16:23,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:23,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:23,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 23:16:23,013 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:23,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1876284459, now seen corresponding path program 7 times [2024-06-27 23:16:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:23,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098793502] [2024-06-27 23:16:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:25,257 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-27 23:16:25,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098793502] [2024-06-27 23:16:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098793502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:25,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:25,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533313644] [2024-06-27 23:16:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:25,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:25,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:16:25,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 651 transitions, 11099 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-27 23:16:25,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:25,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:16:25,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:27,881 INFO L124 PetriNetUnfolderBase]: 5596/8653 cut-off events. [2024-06-27 23:16:27,881 INFO L125 PetriNetUnfolderBase]: For 1268290/1268315 co-relation queries the response was YES. [2024-06-27 23:16:27,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91796 conditions, 8653 events. 5596/8653 cut-off events. For 1268290/1268315 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 52077 event pairs, 2137 based on Foata normal form. 4/8623 useless extension candidates. Maximal degree in co-relation 91623. Up to 8264 conditions per place. [2024-06-27 23:16:28,021 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 616 selfloop transitions, 58 changer transitions 0/685 dead transitions. [2024-06-27 23:16:28,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 685 transitions, 12764 flow [2024-06-27 23:16:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 23:16:28,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-27 23:16:28,022 INFO L175 Difference]: Start difference. First operand has 368 places, 651 transitions, 11099 flow. Second operand 10 states and 177 transitions. [2024-06-27 23:16:28,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 685 transitions, 12764 flow [2024-06-27 23:16:32,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 685 transitions, 12373 flow, removed 47 selfloop flow, removed 9 redundant places. [2024-06-27 23:16:32,287 INFO L231 Difference]: Finished difference. Result has 369 places, 653 transitions, 10938 flow [2024-06-27 23:16:32,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10708, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10938, PETRI_PLACES=369, PETRI_TRANSITIONS=653} [2024-06-27 23:16:32,288 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 326 predicate places. [2024-06-27 23:16:32,288 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 653 transitions, 10938 flow [2024-06-27 23:16:32,288 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-27 23:16:32,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:32,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:32,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 23:16:32,288 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:32,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1518542556, now seen corresponding path program 8 times [2024-06-27 23:16:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:32,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453477590] [2024-06-27 23:16:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:34,341 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-27 23:16:34,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:34,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453477590] [2024-06-27 23:16:34,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453477590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:34,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:34,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:34,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011097100] [2024-06-27 23:16:34,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:34,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:34,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:34,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:34,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:34,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:16:34,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 653 transitions, 10938 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-27 23:16:34,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:34,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:16:34,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:37,007 INFO L124 PetriNetUnfolderBase]: 5591/8639 cut-off events. [2024-06-27 23:16:37,007 INFO L125 PetriNetUnfolderBase]: For 1283260/1283287 co-relation queries the response was YES. [2024-06-27 23:16:37,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91417 conditions, 8639 events. 5591/8639 cut-off events. For 1283260/1283287 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 51817 event pairs, 2144 based on Foata normal form. 2/8607 useless extension candidates. Maximal degree in co-relation 91245. Up to 7967 conditions per place. [2024-06-27 23:16:37,140 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 552 selfloop transitions, 128 changer transitions 0/691 dead transitions. [2024-06-27 23:16:37,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 691 transitions, 12698 flow [2024-06-27 23:16:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-06-27 23:16:37,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-27 23:16:37,142 INFO L175 Difference]: Start difference. First operand has 369 places, 653 transitions, 10938 flow. Second operand 10 states and 178 transitions. [2024-06-27 23:16:37,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 691 transitions, 12698 flow [2024-06-27 23:16:41,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 691 transitions, 12353 flow, removed 71 selfloop flow, removed 10 redundant places. [2024-06-27 23:16:41,254 INFO L231 Difference]: Finished difference. Result has 369 places, 653 transitions, 10861 flow [2024-06-27 23:16:41,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10593, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10861, PETRI_PLACES=369, PETRI_TRANSITIONS=653} [2024-06-27 23:16:41,254 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 326 predicate places. [2024-06-27 23:16:41,254 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 653 transitions, 10861 flow [2024-06-27 23:16:41,255 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-27 23:16:41,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:41,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:41,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 23:16:41,255 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:41,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1523910888, now seen corresponding path program 17 times [2024-06-27 23:16:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:41,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880560255] [2024-06-27 23:16:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:41,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:43,531 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-27 23:16:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:43,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880560255] [2024-06-27 23:16:43,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880560255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:43,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:43,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897568048] [2024-06-27 23:16:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:43,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:43,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:43,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:43,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 653 transitions, 10861 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-27 23:16:43,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:43,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:43,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:46,106 INFO L124 PetriNetUnfolderBase]: 5209/8195 cut-off events. [2024-06-27 23:16:46,106 INFO L125 PetriNetUnfolderBase]: For 1401972/1402007 co-relation queries the response was YES. [2024-06-27 23:16:46,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90086 conditions, 8195 events. 5209/8195 cut-off events. For 1401972/1402007 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 50748 event pairs, 1846 based on Foata normal form. 27/8120 useless extension candidates. Maximal degree in co-relation 89913. Up to 7384 conditions per place. [2024-06-27 23:16:46,239 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 558 selfloop transitions, 109 changer transitions 0/694 dead transitions. [2024-06-27 23:16:46,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 694 transitions, 12674 flow [2024-06-27 23:16:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-27 23:16:46,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45476190476190476 [2024-06-27 23:16:46,243 INFO L175 Difference]: Start difference. First operand has 369 places, 653 transitions, 10861 flow. Second operand 10 states and 191 transitions. [2024-06-27 23:16:46,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 694 transitions, 12674 flow [2024-06-27 23:16:50,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 694 transitions, 12312 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 23:16:50,707 INFO L231 Difference]: Finished difference. Result has 370 places, 657 transitions, 10899 flow [2024-06-27 23:16:50,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10499, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10899, PETRI_PLACES=370, PETRI_TRANSITIONS=657} [2024-06-27 23:16:50,708 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 327 predicate places. [2024-06-27 23:16:50,708 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 657 transitions, 10899 flow [2024-06-27 23:16:50,708 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-27 23:16:50,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:50,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:50,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 23:16:50,709 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:50,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1518548508, now seen corresponding path program 18 times [2024-06-27 23:16:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475125626] [2024-06-27 23:16:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:16:52,984 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-27 23:16:52,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:16:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475125626] [2024-06-27 23:16:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475125626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:16:52,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:16:52,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:16:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933892059] [2024-06-27 23:16:52,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:16:52,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:16:52,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:16:52,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:16:52,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:16:53,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:16:53,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 657 transitions, 10899 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-27 23:16:53,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:16:53,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:16:53,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:16:55,685 INFO L124 PetriNetUnfolderBase]: 5248/8264 cut-off events. [2024-06-27 23:16:55,685 INFO L125 PetriNetUnfolderBase]: For 1437889/1437924 co-relation queries the response was YES. [2024-06-27 23:16:55,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90626 conditions, 8264 events. 5248/8264 cut-off events. For 1437889/1437924 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 51287 event pairs, 1866 based on Foata normal form. 27/8193 useless extension candidates. Maximal degree in co-relation 90451. Up to 7449 conditions per place. [2024-06-27 23:16:55,821 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 568 selfloop transitions, 102 changer transitions 0/697 dead transitions. [2024-06-27 23:16:55,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 697 transitions, 12666 flow [2024-06-27 23:16:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:16:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:16:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-27 23:16:55,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 23:16:55,823 INFO L175 Difference]: Start difference. First operand has 370 places, 657 transitions, 10899 flow. Second operand 10 states and 192 transitions. [2024-06-27 23:16:55,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 697 transitions, 12666 flow [2024-06-27 23:16:59,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 697 transitions, 12341 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-27 23:16:59,679 INFO L231 Difference]: Finished difference. Result has 374 places, 658 transitions, 10872 flow [2024-06-27 23:16:59,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10574, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10872, PETRI_PLACES=374, PETRI_TRANSITIONS=658} [2024-06-27 23:16:59,680 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 331 predicate places. [2024-06-27 23:16:59,680 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 658 transitions, 10872 flow [2024-06-27 23:16:59,680 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-27 23:16:59,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:16:59,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:16:59,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 23:16:59,680 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:16:59,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:16:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash -478930469, now seen corresponding path program 3 times [2024-06-27 23:16:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:16:59,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768711566] [2024-06-27 23:16:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:16:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:16:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:01,349 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-27 23:17:01,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:01,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768711566] [2024-06-27 23:17:01,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768711566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:01,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:01,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:01,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956011375] [2024-06-27 23:17:01,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:01,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:01,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:01,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:01,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:01,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 658 transitions, 10872 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-27 23:17:01,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:01,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:01,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:03,683 INFO L124 PetriNetUnfolderBase]: 5431/8531 cut-off events. [2024-06-27 23:17:03,683 INFO L125 PetriNetUnfolderBase]: For 1357581/1357711 co-relation queries the response was YES. [2024-06-27 23:17:03,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90480 conditions, 8531 events. 5431/8531 cut-off events. For 1357581/1357711 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 53262 event pairs, 2149 based on Foata normal form. 49/8479 useless extension candidates. Maximal degree in co-relation 90303. Up to 7999 conditions per place. [2024-06-27 23:17:03,820 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 553 selfloop transitions, 26 changer transitions 0/677 dead transitions. [2024-06-27 23:17:03,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 677 transitions, 12371 flow [2024-06-27 23:17:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:17:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:17:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-27 23:17:03,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 23:17:03,821 INFO L175 Difference]: Start difference. First operand has 374 places, 658 transitions, 10872 flow. Second operand 7 states and 126 transitions. [2024-06-27 23:17:03,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 677 transitions, 12371 flow [2024-06-27 23:17:07,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 677 transitions, 12042 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-27 23:17:07,861 INFO L231 Difference]: Finished difference. Result has 374 places, 667 transitions, 10744 flow [2024-06-27 23:17:07,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10543, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10744, PETRI_PLACES=374, PETRI_TRANSITIONS=667} [2024-06-27 23:17:07,861 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 331 predicate places. [2024-06-27 23:17:07,862 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 667 transitions, 10744 flow [2024-06-27 23:17:07,862 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-27 23:17:07,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:07,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:07,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 23:17:07,862 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:07,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash -478484999, now seen corresponding path program 4 times [2024-06-27 23:17:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:07,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79115628] [2024-06-27 23:17:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:07,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:09,318 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-27 23:17:09,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:09,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79115628] [2024-06-27 23:17:09,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79115628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:09,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:09,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:09,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313970252] [2024-06-27 23:17:09,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:09,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:09,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:09,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:09,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:09,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:17:09,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 667 transitions, 10744 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-27 23:17:09,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:09,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:17:09,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:11,725 INFO L124 PetriNetUnfolderBase]: 5425/8523 cut-off events. [2024-06-27 23:17:11,725 INFO L125 PetriNetUnfolderBase]: For 1366138/1366254 co-relation queries the response was YES. [2024-06-27 23:17:11,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90043 conditions, 8523 events. 5425/8523 cut-off events. For 1366138/1366254 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 53233 event pairs, 2141 based on Foata normal form. 50/8472 useless extension candidates. Maximal degree in co-relation 89862. Up to 8008 conditions per place. [2024-06-27 23:17:11,868 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 562 selfloop transitions, 16 changer transitions 0/676 dead transitions. [2024-06-27 23:17:11,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 676 transitions, 11948 flow [2024-06-27 23:17:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:17:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:17:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-27 23:17:11,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41156462585034015 [2024-06-27 23:17:11,869 INFO L175 Difference]: Start difference. First operand has 374 places, 667 transitions, 10744 flow. Second operand 7 states and 121 transitions. [2024-06-27 23:17:11,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 676 transitions, 11948 flow [2024-06-27 23:17:16,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 676 transitions, 11879 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-06-27 23:17:16,511 INFO L231 Difference]: Finished difference. Result has 379 places, 667 transitions, 10713 flow [2024-06-27 23:17:16,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10675, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10713, PETRI_PLACES=379, PETRI_TRANSITIONS=667} [2024-06-27 23:17:16,512 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 336 predicate places. [2024-06-27 23:17:16,512 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 667 transitions, 10713 flow [2024-06-27 23:17:16,512 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-27 23:17:16,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:16,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:16,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 23:17:16,512 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:16,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash -685549344, now seen corresponding path program 1 times [2024-06-27 23:17:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147694638] [2024-06-27 23:17:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:18,550 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-27 23:17:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147694638] [2024-06-27 23:17:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147694638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:18,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:18,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179719366] [2024-06-27 23:17:18,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:18,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:18,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:17:18,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 667 transitions, 10713 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-27 23:17:18,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:18,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:17:18,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:21,456 INFO L124 PetriNetUnfolderBase]: 5883/9043 cut-off events. [2024-06-27 23:17:21,456 INFO L125 PetriNetUnfolderBase]: For 1372322/1372322 co-relation queries the response was YES. [2024-06-27 23:17:21,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94589 conditions, 9043 events. 5883/9043 cut-off events. For 1372322/1372322 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54083 event pairs, 2273 based on Foata normal form. 1/9043 useless extension candidates. Maximal degree in co-relation 94405. Up to 8893 conditions per place. [2024-06-27 23:17:21,583 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 658 selfloop transitions, 29 changer transitions 0/690 dead transitions. [2024-06-27 23:17:21,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 690 transitions, 12467 flow [2024-06-27 23:17:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:17:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:17:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-27 23:17:21,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-27 23:17:21,585 INFO L175 Difference]: Start difference. First operand has 379 places, 667 transitions, 10713 flow. Second operand 7 states and 119 transitions. [2024-06-27 23:17:21,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 690 transitions, 12467 flow [2024-06-27 23:17:26,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 690 transitions, 12403 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 23:17:26,140 INFO L231 Difference]: Finished difference. Result has 381 places, 675 transitions, 10844 flow [2024-06-27 23:17:26,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10649, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10844, PETRI_PLACES=381, PETRI_TRANSITIONS=675} [2024-06-27 23:17:26,141 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 338 predicate places. [2024-06-27 23:17:26,141 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 675 transitions, 10844 flow [2024-06-27 23:17:26,141 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-27 23:17:26,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:26,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:26,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 23:17:26,142 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:26,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1229867298, now seen corresponding path program 2 times [2024-06-27 23:17:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:26,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333380822] [2024-06-27 23:17:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:26,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:28,200 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-27 23:17:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:28,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333380822] [2024-06-27 23:17:28,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333380822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:28,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:28,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050088352] [2024-06-27 23:17:28,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:28,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:28,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:28,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:28,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:17:28,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 675 transitions, 10844 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-27 23:17:28,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:28,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:17:28,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:30,953 INFO L124 PetriNetUnfolderBase]: 5888/9050 cut-off events. [2024-06-27 23:17:30,953 INFO L125 PetriNetUnfolderBase]: For 1399089/1399089 co-relation queries the response was YES. [2024-06-27 23:17:31,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95591 conditions, 9050 events. 5888/9050 cut-off events. For 1399089/1399089 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54133 event pairs, 2273 based on Foata normal form. 1/9050 useless extension candidates. Maximal degree in co-relation 95404. Up to 8899 conditions per place. [2024-06-27 23:17:31,102 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 657 selfloop transitions, 31 changer transitions 0/691 dead transitions. [2024-06-27 23:17:31,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 691 transitions, 12533 flow [2024-06-27 23:17:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:17:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:17:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 23:17:31,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2024-06-27 23:17:31,103 INFO L175 Difference]: Start difference. First operand has 381 places, 675 transitions, 10844 flow. Second operand 7 states and 117 transitions. [2024-06-27 23:17:31,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 691 transitions, 12533 flow [2024-06-27 23:17:36,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 691 transitions, 12490 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-27 23:17:36,912 INFO L231 Difference]: Finished difference. Result has 386 places, 678 transitions, 10914 flow [2024-06-27 23:17:36,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10811, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10914, PETRI_PLACES=386, PETRI_TRANSITIONS=678} [2024-06-27 23:17:36,913 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 343 predicate places. [2024-06-27 23:17:36,913 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 678 transitions, 10914 flow [2024-06-27 23:17:36,913 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-27 23:17:36,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:36,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:36,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 23:17:36,914 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:36,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1073967967, now seen corresponding path program 1 times [2024-06-27 23:17:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773323850] [2024-06-27 23:17:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:38,969 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-27 23:17:38,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:38,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773323850] [2024-06-27 23:17:38,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773323850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:38,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:38,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:38,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247432277] [2024-06-27 23:17:38,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:38,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:38,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:38,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:39,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:17:39,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 678 transitions, 10914 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-27 23:17:39,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:39,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:17:39,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:41,761 INFO L124 PetriNetUnfolderBase]: 5903/9070 cut-off events. [2024-06-27 23:17:41,762 INFO L125 PetriNetUnfolderBase]: For 1431617/1431617 co-relation queries the response was YES. [2024-06-27 23:17:41,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96063 conditions, 9070 events. 5903/9070 cut-off events. For 1431617/1431617 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 54223 event pairs, 2284 based on Foata normal form. 3/9072 useless extension candidates. Maximal degree in co-relation 95872. Up to 8905 conditions per place. [2024-06-27 23:17:41,913 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 669 selfloop transitions, 29 changer transitions 0/701 dead transitions. [2024-06-27 23:17:41,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 701 transitions, 12690 flow [2024-06-27 23:17:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:17:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:17:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-27 23:17:41,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-27 23:17:41,915 INFO L175 Difference]: Start difference. First operand has 386 places, 678 transitions, 10914 flow. Second operand 7 states and 123 transitions. [2024-06-27 23:17:41,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 701 transitions, 12690 flow [2024-06-27 23:17:47,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 701 transitions, 12638 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 23:17:47,067 INFO L231 Difference]: Finished difference. Result has 390 places, 684 transitions, 11022 flow [2024-06-27 23:17:47,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10862, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11022, PETRI_PLACES=390, PETRI_TRANSITIONS=684} [2024-06-27 23:17:47,067 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 347 predicate places. [2024-06-27 23:17:47,067 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 684 transitions, 11022 flow [2024-06-27 23:17:47,068 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-27 23:17:47,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:47,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:47,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 23:17:47,068 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:47,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:47,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1744865245, now seen corresponding path program 2 times [2024-06-27 23:17:47,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:47,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428346611] [2024-06-27 23:17:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:49,099 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-27 23:17:49,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428346611] [2024-06-27 23:17:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428346611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:49,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:49,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:49,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133452999] [2024-06-27 23:17:49,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:49,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:49,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:17:49,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 684 transitions, 11022 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-27 23:17:49,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:49,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:17:49,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:17:52,016 INFO L124 PetriNetUnfolderBase]: 5918/9092 cut-off events. [2024-06-27 23:17:52,016 INFO L125 PetriNetUnfolderBase]: For 1459311/1459314 co-relation queries the response was YES. [2024-06-27 23:17:52,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96841 conditions, 9092 events. 5918/9092 cut-off events. For 1459311/1459314 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 54298 event pairs, 2284 based on Foata normal form. 5/9095 useless extension candidates. Maximal degree in co-relation 96647. Up to 8919 conditions per place. [2024-06-27 23:17:52,163 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 665 selfloop transitions, 33 changer transitions 0/701 dead transitions. [2024-06-27 23:17:52,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 701 transitions, 12728 flow [2024-06-27 23:17:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:17:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:17:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 23:17:52,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2024-06-27 23:17:52,164 INFO L175 Difference]: Start difference. First operand has 390 places, 684 transitions, 11022 flow. Second operand 7 states and 117 transitions. [2024-06-27 23:17:52,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 701 transitions, 12728 flow [2024-06-27 23:17:57,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 701 transitions, 12673 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 23:17:57,760 INFO L231 Difference]: Finished difference. Result has 393 places, 687 transitions, 11093 flow [2024-06-27 23:17:57,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10971, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11093, PETRI_PLACES=393, PETRI_TRANSITIONS=687} [2024-06-27 23:17:57,760 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 350 predicate places. [2024-06-27 23:17:57,761 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 687 transitions, 11093 flow [2024-06-27 23:17:57,761 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-27 23:17:57,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:17:57,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:17:57,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 23:17:57,761 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:17:57,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:17:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash -478745957, now seen corresponding path program 3 times [2024-06-27 23:17:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:17:57,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229619234] [2024-06-27 23:17:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:17:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:17:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:17:59,858 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-27 23:17:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:17:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229619234] [2024-06-27 23:17:59,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229619234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:17:59,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:17:59,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:17:59,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699077445] [2024-06-27 23:17:59,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:17:59,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:17:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:17:59,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:17:59,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:17:59,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:17:59,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 687 transitions, 11093 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-27 23:17:59,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:17:59,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:17:59,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:02,574 INFO L124 PetriNetUnfolderBase]: 5909/9080 cut-off events. [2024-06-27 23:18:02,574 INFO L125 PetriNetUnfolderBase]: For 1472670/1472673 co-relation queries the response was YES. [2024-06-27 23:18:02,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96762 conditions, 9080 events. 5909/9080 cut-off events. For 1472670/1472673 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54297 event pairs, 2275 based on Foata normal form. 5/9083 useless extension candidates. Maximal degree in co-relation 96565. Up to 8912 conditions per place. [2024-06-27 23:18:02,735 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 667 selfloop transitions, 32 changer transitions 0/702 dead transitions. [2024-06-27 23:18:02,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 702 transitions, 12569 flow [2024-06-27 23:18:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:18:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:18:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-27 23:18:02,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-27 23:18:02,737 INFO L175 Difference]: Start difference. First operand has 393 places, 687 transitions, 11093 flow. Second operand 7 states and 119 transitions. [2024-06-27 23:18:02,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 702 transitions, 12569 flow [2024-06-27 23:18:07,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 702 transitions, 12441 flow, removed 48 selfloop flow, removed 3 redundant places. [2024-06-27 23:18:07,566 INFO L231 Difference]: Finished difference. Result has 397 places, 687 transitions, 11037 flow [2024-06-27 23:18:07,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10965, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11037, PETRI_PLACES=397, PETRI_TRANSITIONS=687} [2024-06-27 23:18:07,566 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 354 predicate places. [2024-06-27 23:18:07,566 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 687 transitions, 11037 flow [2024-06-27 23:18:07,566 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-27 23:18:07,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:07,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:07,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 23:18:07,567 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:07,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash -478746174, now seen corresponding path program 3 times [2024-06-27 23:18:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:07,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085779694] [2024-06-27 23:18:07,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:09,643 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-27 23:18:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085779694] [2024-06-27 23:18:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085779694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:18:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848210894] [2024-06-27 23:18:09,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:09,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:18:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:09,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:18:09,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:18:09,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:18:09,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 687 transitions, 11037 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-27 23:18:09,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:09,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:18:09,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:12,461 INFO L124 PetriNetUnfolderBase]: 5906/9077 cut-off events. [2024-06-27 23:18:12,461 INFO L125 PetriNetUnfolderBase]: For 1481667/1481673 co-relation queries the response was YES. [2024-06-27 23:18:12,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96698 conditions, 9077 events. 5906/9077 cut-off events. For 1481667/1481673 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54346 event pairs, 2263 based on Foata normal form. 5/9078 useless extension candidates. Maximal degree in co-relation 96498. Up to 8926 conditions per place. [2024-06-27 23:18:12,613 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 662 selfloop transitions, 31 changer transitions 0/696 dead transitions. [2024-06-27 23:18:12,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 696 transitions, 12471 flow [2024-06-27 23:18:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:18:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:18:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-27 23:18:12,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2024-06-27 23:18:12,614 INFO L175 Difference]: Start difference. First operand has 397 places, 687 transitions, 11037 flow. Second operand 7 states and 113 transitions. [2024-06-27 23:18:12,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 696 transitions, 12471 flow [2024-06-27 23:18:18,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 696 transitions, 12411 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-27 23:18:18,174 INFO L231 Difference]: Finished difference. Result has 401 places, 687 transitions, 11047 flow [2024-06-27 23:18:18,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10977, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11047, PETRI_PLACES=401, PETRI_TRANSITIONS=687} [2024-06-27 23:18:18,174 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 358 predicate places. [2024-06-27 23:18:18,175 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 687 transitions, 11047 flow [2024-06-27 23:18:18,175 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-27 23:18:18,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:18,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:18,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 23:18:18,175 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:18,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1136049193, now seen corresponding path program 1 times [2024-06-27 23:18:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29346398] [2024-06-27 23:18:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:19,829 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-27 23:18:19,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29346398] [2024-06-27 23:18:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29346398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:19,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:18:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002039770] [2024-06-27 23:18:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:19,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:18:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:19,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:18:19,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:18:19,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:18:19,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 687 transitions, 11047 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-27 23:18:19,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:19,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:18:19,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:22,458 INFO L124 PetriNetUnfolderBase]: 5710/8853 cut-off events. [2024-06-27 23:18:22,458 INFO L125 PetriNetUnfolderBase]: For 1519977/1520041 co-relation queries the response was YES. [2024-06-27 23:18:22,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95380 conditions, 8853 events. 5710/8853 cut-off events. For 1519977/1520041 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 53977 event pairs, 1709 based on Foata normal form. 42/8843 useless extension candidates. Maximal degree in co-relation 95177. Up to 8364 conditions per place. [2024-06-27 23:18:22,615 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 611 selfloop transitions, 71 changer transitions 0/732 dead transitions. [2024-06-27 23:18:22,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 732 transitions, 13020 flow [2024-06-27 23:18:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:18:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:18:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 23:18:22,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 23:18:22,616 INFO L175 Difference]: Start difference. First operand has 401 places, 687 transitions, 11047 flow. Second operand 8 states and 150 transitions. [2024-06-27 23:18:22,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 732 transitions, 13020 flow [2024-06-27 23:18:27,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 732 transitions, 12964 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 23:18:27,416 INFO L231 Difference]: Finished difference. Result has 405 places, 708 transitions, 11451 flow [2024-06-27 23:18:27,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10991, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11451, PETRI_PLACES=405, PETRI_TRANSITIONS=708} [2024-06-27 23:18:27,416 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 362 predicate places. [2024-06-27 23:18:27,416 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 708 transitions, 11451 flow [2024-06-27 23:18:27,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-27 23:18:27,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:27,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:27,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 23:18:27,417 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:27,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash -32274789, now seen corresponding path program 1 times [2024-06-27 23:18:27,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:27,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046311005] [2024-06-27 23:18:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:27,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:29,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-27 23:18:29,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046311005] [2024-06-27 23:18:29,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046311005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:29,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:29,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:18:29,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034704498] [2024-06-27 23:18:29,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:29,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:18:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:29,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:18:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:18:29,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:18:29,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 708 transitions, 11451 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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-27 23:18:29,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:29,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:18:29,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:32,945 INFO L124 PetriNetUnfolderBase]: 5858/9049 cut-off events. [2024-06-27 23:18:32,945 INFO L125 PetriNetUnfolderBase]: For 1624005/1624020 co-relation queries the response was YES. [2024-06-27 23:18:33,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99156 conditions, 9049 events. 5858/9049 cut-off events. For 1624005/1624020 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 54832 event pairs, 1611 based on Foata normal form. 6/9018 useless extension candidates. Maximal degree in co-relation 98951. Up to 8527 conditions per place. [2024-06-27 23:18:33,084 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 627 selfloop transitions, 109 changer transitions 0/758 dead transitions. [2024-06-27 23:18:33,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 758 transitions, 13378 flow [2024-06-27 23:18:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 23:18:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 23:18:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 232 transitions. [2024-06-27 23:18:33,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249084249084249 [2024-06-27 23:18:33,086 INFO L175 Difference]: Start difference. First operand has 405 places, 708 transitions, 11451 flow. Second operand 13 states and 232 transitions. [2024-06-27 23:18:33,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 758 transitions, 13378 flow [2024-06-27 23:18:38,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 758 transitions, 13263 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-27 23:18:38,201 INFO L231 Difference]: Finished difference. Result has 414 places, 710 transitions, 11670 flow [2024-06-27 23:18:38,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11336, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11670, PETRI_PLACES=414, PETRI_TRANSITIONS=710} [2024-06-27 23:18:38,202 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 371 predicate places. [2024-06-27 23:18:38,202 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 710 transitions, 11670 flow [2024-06-27 23:18:38,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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-27 23:18:38,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:38,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:18:38,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 23:18:38,202 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:38,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash -171013827, now seen corresponding path program 2 times [2024-06-27 23:18:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092728066] [2024-06-27 23:18:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:40,730 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-27 23:18:40,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:40,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092728066] [2024-06-27 23:18:40,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092728066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:40,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:40,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:18:40,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856316175] [2024-06-27 23:18:40,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:40,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:18:40,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:40,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:18:40,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:18:40,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:40,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 710 transitions, 11670 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-27 23:18:40,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:40,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:40,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:43,873 INFO L124 PetriNetUnfolderBase]: 5732/8887 cut-off events. [2024-06-27 23:18:43,873 INFO L125 PetriNetUnfolderBase]: For 1583545/1583609 co-relation queries the response was YES. [2024-06-27 23:18:43,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97549 conditions, 8887 events. 5732/8887 cut-off events. For 1583545/1583609 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 54224 event pairs, 1712 based on Foata normal form. 42/8877 useless extension candidates. Maximal degree in co-relation 97343. Up to 8397 conditions per place. [2024-06-27 23:18:44,008 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 614 selfloop transitions, 75 changer transitions 0/739 dead transitions. [2024-06-27 23:18:44,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 739 transitions, 13476 flow [2024-06-27 23:18:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:18:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:18:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-27 23:18:44,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-06-27 23:18:44,009 INFO L175 Difference]: Start difference. First operand has 414 places, 710 transitions, 11670 flow. Second operand 7 states and 148 transitions. [2024-06-27 23:18:44,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 739 transitions, 13476 flow [2024-06-27 23:18:50,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 739 transitions, 13174 flow, removed 50 selfloop flow, removed 10 redundant places. [2024-06-27 23:18:50,992 INFO L231 Difference]: Finished difference. Result has 411 places, 713 transitions, 11586 flow [2024-06-27 23:18:50,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11368, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11586, PETRI_PLACES=411, PETRI_TRANSITIONS=713} [2024-06-27 23:18:50,993 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 368 predicate places. [2024-06-27 23:18:50,993 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 713 transitions, 11586 flow [2024-06-27 23:18:50,993 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-27 23:18:50,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:18:50,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-27 23:18:50,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 23:18:50,994 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:18:50,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:18:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 392346693, now seen corresponding path program 3 times [2024-06-27 23:18:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:18:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112332057] [2024-06-27 23:18:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:18:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:18:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:18:53,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-27 23:18:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:18:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112332057] [2024-06-27 23:18:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112332057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:18:53,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:18:53,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:18:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32801145] [2024-06-27 23:18:53,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:18:53,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:18:53,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:18:53,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:18:53,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:18:53,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:18:53,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 713 transitions, 11586 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-27 23:18:53,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:18:53,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:18:53,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:18:56,592 INFO L124 PetriNetUnfolderBase]: 5752/8920 cut-off events. [2024-06-27 23:18:56,592 INFO L125 PetriNetUnfolderBase]: For 1611189/1611239 co-relation queries the response was YES. [2024-06-27 23:18:56,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97712 conditions, 8920 events. 5752/8920 cut-off events. For 1611189/1611239 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 54372 event pairs, 1748 based on Foata normal form. 30/8902 useless extension candidates. Maximal degree in co-relation 97506. Up to 8483 conditions per place. [2024-06-27 23:18:56,719 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 622 selfloop transitions, 73 changer transitions 0/745 dead transitions. [2024-06-27 23:18:56,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 745 transitions, 13282 flow [2024-06-27 23:18:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:18:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:18:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 23:18:56,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 23:18:56,720 INFO L175 Difference]: Start difference. First operand has 411 places, 713 transitions, 11586 flow. Second operand 8 states and 150 transitions. [2024-06-27 23:18:56,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 745 transitions, 13282 flow [2024-06-27 23:19:02,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 745 transitions, 13131 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-27 23:19:02,877 INFO L231 Difference]: Finished difference. Result has 416 places, 725 transitions, 11773 flow [2024-06-27 23:19:02,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11452, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11773, PETRI_PLACES=416, PETRI_TRANSITIONS=725} [2024-06-27 23:19:02,878 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 373 predicate places. [2024-06-27 23:19:02,878 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 725 transitions, 11773 flow [2024-06-27 23:19:02,879 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-27 23:19:02,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:02,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:02,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 23:19:02,879 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:02,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash -696809595, now seen corresponding path program 2 times [2024-06-27 23:19:02,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:02,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044826389] [2024-06-27 23:19:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:05,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-27 23:19:05,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044826389] [2024-06-27 23:19:05,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044826389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:05,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:05,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 23:19:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014148502] [2024-06-27 23:19:05,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:05,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 23:19:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:05,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 23:19:05,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 23:19:06,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:19:06,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 725 transitions, 11773 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-27 23:19:06,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:06,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:19:06,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:09,810 INFO L124 PetriNetUnfolderBase]: 5926/9130 cut-off events. [2024-06-27 23:19:09,810 INFO L125 PetriNetUnfolderBase]: For 1677833/1677851 co-relation queries the response was YES. [2024-06-27 23:19:09,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100470 conditions, 9130 events. 5926/9130 cut-off events. For 1677833/1677851 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 54978 event pairs, 1435 based on Foata normal form. 14/9129 useless extension candidates. Maximal degree in co-relation 100262. Up to 8704 conditions per place. [2024-06-27 23:19:09,946 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 673 selfloop transitions, 84 changer transitions 0/784 dead transitions. [2024-06-27 23:19:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 784 transitions, 13951 flow [2024-06-27 23:19:09,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:19:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:19:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2024-06-27 23:19:09,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-27 23:19:09,948 INFO L175 Difference]: Start difference. First operand has 416 places, 725 transitions, 11773 flow. Second operand 11 states and 196 transitions. [2024-06-27 23:19:09,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 784 transitions, 13951 flow [2024-06-27 23:19:16,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 784 transitions, 13785 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 23:19:16,922 INFO L231 Difference]: Finished difference. Result has 424 places, 748 transitions, 12318 flow [2024-06-27 23:19:16,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11607, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12318, PETRI_PLACES=424, PETRI_TRANSITIONS=748} [2024-06-27 23:19:16,922 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 381 predicate places. [2024-06-27 23:19:16,923 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 748 transitions, 12318 flow [2024-06-27 23:19:16,923 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-27 23:19:16,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:16,923 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-27 23:19:16,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 23:19:16,923 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:16,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1218490158, now seen corresponding path program 1 times [2024-06-27 23:19:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612568388] [2024-06-27 23:19:16,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:20,239 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-27 23:19:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612568388] [2024-06-27 23:19:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612568388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:20,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:20,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 23:19:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734848640] [2024-06-27 23:19:20,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:20,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 23:19:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:20,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 23:19:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 23:19:20,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-27 23:19:20,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 748 transitions, 12318 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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-27 23:19:20,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:20,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-27 23:19:20,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:23,753 INFO L124 PetriNetUnfolderBase]: 5849/9060 cut-off events. [2024-06-27 23:19:23,754 INFO L125 PetriNetUnfolderBase]: For 1698120/1698187 co-relation queries the response was YES. [2024-06-27 23:19:23,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100802 conditions, 9060 events. 5849/9060 cut-off events. For 1698120/1698187 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 55361 event pairs, 1725 based on Foata normal form. 44/9052 useless extension candidates. Maximal degree in co-relation 100591. Up to 8409 conditions per place. [2024-06-27 23:19:24,037 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 647 selfloop transitions, 108 changer transitions 0/805 dead transitions. [2024-06-27 23:19:24,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 805 transitions, 14972 flow [2024-06-27 23:19:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:19:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:19:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-27 23:19:24,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2024-06-27 23:19:24,038 INFO L175 Difference]: Start difference. First operand has 424 places, 748 transitions, 12318 flow. Second operand 9 states and 185 transitions. [2024-06-27 23:19:24,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 805 transitions, 14972 flow [2024-06-27 23:19:29,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 805 transitions, 14738 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-06-27 23:19:29,927 INFO L231 Difference]: Finished difference. Result has 429 places, 767 transitions, 12693 flow [2024-06-27 23:19:29,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12084, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12693, PETRI_PLACES=429, PETRI_TRANSITIONS=767} [2024-06-27 23:19:29,927 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 386 predicate places. [2024-06-27 23:19:29,927 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 767 transitions, 12693 flow [2024-06-27 23:19:29,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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-27 23:19:29,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:29,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:29,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 23:19:29,928 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:29,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 816675527, now seen corresponding path program 1 times [2024-06-27 23:19:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729374292] [2024-06-27 23:19:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:31,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-27 23:19:31,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:31,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729374292] [2024-06-27 23:19:31,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729374292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:31,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:31,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:19:31,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994126889] [2024-06-27 23:19:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:31,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:19:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:31,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:19:31,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:19:31,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-27 23:19:31,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 767 transitions, 12693 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-27 23:19:31,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:31,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-27 23:19:31,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:35,498 INFO L124 PetriNetUnfolderBase]: 6081/9309 cut-off events. [2024-06-27 23:19:35,498 INFO L125 PetriNetUnfolderBase]: For 1729100/1729106 co-relation queries the response was YES. [2024-06-27 23:19:35,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104107 conditions, 9309 events. 6081/9309 cut-off events. For 1729100/1729106 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 55527 event pairs, 1828 based on Foata normal form. 5/9312 useless extension candidates. Maximal degree in co-relation 103893. Up to 9100 conditions per place. [2024-06-27 23:19:35,648 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 744 selfloop transitions, 57 changer transitions 0/804 dead transitions. [2024-06-27 23:19:35,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 804 transitions, 15339 flow [2024-06-27 23:19:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:19:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:19:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 23:19:35,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-27 23:19:35,650 INFO L175 Difference]: Start difference. First operand has 429 places, 767 transitions, 12693 flow. Second operand 8 states and 143 transitions. [2024-06-27 23:19:35,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 804 transitions, 15339 flow [2024-06-27 23:19:42,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 804 transitions, 15245 flow, removed 41 selfloop flow, removed 2 redundant places. [2024-06-27 23:19:42,139 INFO L231 Difference]: Finished difference. Result has 435 places, 780 transitions, 13006 flow [2024-06-27 23:19:42,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12607, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13006, PETRI_PLACES=435, PETRI_TRANSITIONS=780} [2024-06-27 23:19:42,140 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 392 predicate places. [2024-06-27 23:19:42,140 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 780 transitions, 13006 flow [2024-06-27 23:19:42,140 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-27 23:19:42,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:42,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:42,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 23:19:42,140 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:42,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1052159647, now seen corresponding path program 3 times [2024-06-27 23:19:42,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:42,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12993515] [2024-06-27 23:19:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:42,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:44,867 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-27 23:19:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12993515] [2024-06-27 23:19:44,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12993515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:44,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:44,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 23:19:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081101039] [2024-06-27 23:19:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 23:19:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:44,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 23:19:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 23:19:45,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:19:45,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 780 transitions, 13006 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-27 23:19:45,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:45,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:19:45,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:19:49,103 INFO L124 PetriNetUnfolderBase]: 6136/9431 cut-off events. [2024-06-27 23:19:49,104 INFO L125 PetriNetUnfolderBase]: For 1815949/1815974 co-relation queries the response was YES. [2024-06-27 23:19:49,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106438 conditions, 9431 events. 6136/9431 cut-off events. For 1815949/1815974 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 56888 event pairs, 1384 based on Foata normal form. 15/9425 useless extension candidates. Maximal degree in co-relation 106221. Up to 8101 conditions per place. [2024-06-27 23:19:49,254 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 493 selfloop transitions, 357 changer transitions 0/881 dead transitions. [2024-06-27 23:19:49,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 881 transitions, 15838 flow [2024-06-27 23:19:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 23:19:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 23:19:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-27 23:19:49,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-27 23:19:49,255 INFO L175 Difference]: Start difference. First operand has 435 places, 780 transitions, 13006 flow. Second operand 11 states and 210 transitions. [2024-06-27 23:19:49,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 881 transitions, 15838 flow [2024-06-27 23:19:55,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 881 transitions, 15725 flow, removed 49 selfloop flow, removed 2 redundant places. [2024-06-27 23:19:55,180 INFO L231 Difference]: Finished difference. Result has 446 places, 832 transitions, 14532 flow [2024-06-27 23:19:55,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12893, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14532, PETRI_PLACES=446, PETRI_TRANSITIONS=832} [2024-06-27 23:19:55,181 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 403 predicate places. [2024-06-27 23:19:55,181 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 832 transitions, 14532 flow [2024-06-27 23:19:55,181 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-27 23:19:55,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:19:55,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:19:55,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 23:19:55,182 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-27 23:19:55,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:19:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1224649537, now seen corresponding path program 4 times [2024-06-27 23:19:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:19:55,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199452791] [2024-06-27 23:19:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:19:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:19:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:19:58,054 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-27 23:19:58,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:19:58,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199452791] [2024-06-27 23:19:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199452791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:19:58,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:19:58,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 23:19:58,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564951811] [2024-06-27 23:19:58,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:19:58,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 23:19:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:19:58,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 23:19:58,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 23:19:58,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-27 23:19:58,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 832 transitions, 14532 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-27 23:19:58,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:19:58,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-27 23:19:58,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand