./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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-cde23df-m [2024-06-14 15:54:52,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:54:52,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:54:52,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:54:52,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:54:52,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:54:52,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:54:52,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:54:52,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:54:52,609 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:54:52,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:54:52,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:54:52,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:54:52,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:54:52,614 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:54:52,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:54:52,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:54:52,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:54:52,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:54:52,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:54:52,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:54:52,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:54:52,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:54:52,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:54:52,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:54:52,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:54:52,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:54:52,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:54:52,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:54:52,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:54:52,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:54:52,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:54:52,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:54:52,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:54:52,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:54:52,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:54:52,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:54:52,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:54:52,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:54:52,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:54:52,621 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:54:52,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:54:52,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:54:52,622 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-14 15:54:52,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:54:52,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:54:52,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:54:52,840 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:54:52,841 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:54:52,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-14 15:54:53,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:54:53,065 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:54:53,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:54:54,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:54:54,268 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:54:54,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:54:54,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c69689b9/f2445393ef33496cae3484066511bed7/FLAG63f86ab6b [2024-06-14 15:54:54,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c69689b9/f2445393ef33496cae3484066511bed7 [2024-06-14 15:54:54,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:54:54,305 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:54:54,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:54:54,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:54:54,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:54:54,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:54:53" (1/2) ... [2024-06-14 15:54:54,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f366360 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:54:54, skipping insertion in model container [2024-06-14 15:54:54,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:54:53" (1/2) ... [2024-06-14 15:54:54,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6cd1dd62 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:54:54, skipping insertion in model container [2024-06-14 15:54:54,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:54:54" (2/2) ... [2024-06-14 15:54:54,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f366360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:54, skipping insertion in model container [2024-06-14 15:54:54,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:54:54" (2/2) ... [2024-06-14 15:54:54,313 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:54:54,428 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:54:54,430 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-06-14 15:54:54,432 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-06-14 15:54:54,433 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 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_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2))) [2024-06-14 15:54:54,433 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:54:54,434 INFO L106 edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1; [2024-06-14 15:54:54,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:54:54,778 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:54:54,786 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:54:55,136 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:54:55,167 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:54:55,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55 WrapperNode [2024-06-14 15:54:55,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:54:55,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:54:55,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:54:55,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:54:55,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,383 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-06-14 15:54:55,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:54:55,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:54:55,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:54:55,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:54:55,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,509 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-14 15:54:55,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:54:55,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:54:55,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:54:55,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:54:55,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (1/1) ... [2024-06-14 15:54:55,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:54:55,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:54:55,614 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-14 15:54:55,632 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-14 15:54:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:54:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:54:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:54:55,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:54:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:54:55,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:54:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 15:54:55,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 15:54:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:54:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:54:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:54:55,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:54:55,656 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:54:55,865 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:54:55,867 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:54:56,807 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:54:56,807 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:54:57,057 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:54:57,057 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:54:57,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:54:57 BoogieIcfgContainer [2024-06-14 15:54:57,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:54:57,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:54:57,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:54:57,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:54:57,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:54:53" (1/4) ... [2024-06-14 15:54:57,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3bf03f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:54:57, skipping insertion in model container [2024-06-14 15:54:57,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:54:54" (2/4) ... [2024-06-14 15:54:57,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3bf03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:54:57, skipping insertion in model container [2024-06-14 15:54:57,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:54:55" (3/4) ... [2024-06-14 15:54:57,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3bf03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:54:57, skipping insertion in model container [2024-06-14 15:54:57,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:54:57" (4/4) ... [2024-06-14 15:54:57,066 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:54:57,079 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:54:57,079 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 15:54:57,080 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:54:57,188 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:54:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:54:57,263 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-14 15:54:57,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:54:57,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:54:57,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:54:57,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-14 15:54:57,278 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:54:57,284 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;@568b197e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:54:57,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 15:54:57,292 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:54:57,292 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:54:57,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:54:57,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:57,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:54:57,293 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-14 15:54:57,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1352874220, now seen corresponding path program 1 times [2024-06-14 15:54:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:57,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249374432] [2024-06-14 15:54:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:02,429 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-14 15:55:02,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249374432] [2024-06-14 15:55:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249374432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:02,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:02,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:55:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690382687] [2024-06-14 15:55:02,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:02,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:55:02,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:55:02,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:55:02,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:55:02,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:02,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:02,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:55:02,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:03,224 INFO L124 PetriNetUnfolderBase]: 1156/1755 cut-off events. [2024-06-14 15:55:03,224 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-14 15:55:03,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 1755 events. 1156/1755 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8046 event pairs, 805 based on Foata normal form. 1/1718 useless extension candidates. Maximal degree in co-relation 3569. Up to 1740 conditions per place. [2024-06-14 15:55:03,239 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-14 15:55:03,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 173 flow [2024-06-14 15:55:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:55:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:55:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-14 15:55:03,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2024-06-14 15:55:03,251 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 70 transitions. [2024-06-14 15:55:03,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 173 flow [2024-06-14 15:55:03,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 15:55:03,256 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-14 15:55:03,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-14 15:55:03,260 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-14 15:55:03,260 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-14 15:55:03,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:03,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:03,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:03,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:55:03,261 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-14 15:55:03,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1263011443, now seen corresponding path program 1 times [2024-06-14 15:55:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:03,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178749236] [2024-06-14 15:55:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:07,174 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-14 15:55:07,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178749236] [2024-06-14 15:55:07,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178749236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:07,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:55:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491109438] [2024-06-14 15:55:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:07,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:55:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:07,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:55:07,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:55:07,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:55:07,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:07,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:07,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:55:07,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:08,028 INFO L124 PetriNetUnfolderBase]: 1150/1746 cut-off events. [2024-06-14 15:55:08,029 INFO L125 PetriNetUnfolderBase]: For 327/334 co-relation queries the response was YES. [2024-06-14 15:55:08,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 1746 events. 1150/1746 cut-off events. For 327/334 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7823 event pairs, 699 based on Foata normal form. 7/1749 useless extension candidates. Maximal degree in co-relation 4040. Up to 1716 conditions per place. [2024-06-14 15:55:08,039 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 40 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-14 15:55:08,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 240 flow [2024-06-14 15:55:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:55:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:55:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-06-14 15:55:08,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2024-06-14 15:55:08,041 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 90 transitions. [2024-06-14 15:55:08,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 240 flow [2024-06-14 15:55:08,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:55:08,043 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-14 15:55:08,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-14 15:55:08,044 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-14 15:55:08,044 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-14 15:55:08,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:08,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:08,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:08,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:55:08,045 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-14 15:55:08,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:08,045 INFO L85 PathProgramCache]: Analyzing trace with hash 498650573, now seen corresponding path program 1 times [2024-06-14 15:55:08,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:08,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976238074] [2024-06-14 15:55:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:08,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:11,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976238074] [2024-06-14 15:55:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976238074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:11,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:11,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:55:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990733748] [2024-06-14 15:55:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:11,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:55:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:55:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:55:11,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:55:11,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:11,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:11,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:55:11,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:11,861 INFO L124 PetriNetUnfolderBase]: 1385/2087 cut-off events. [2024-06-14 15:55:11,862 INFO L125 PetriNetUnfolderBase]: For 1057/1065 co-relation queries the response was YES. [2024-06-14 15:55:11,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5368 conditions, 2087 events. 1385/2087 cut-off events. For 1057/1065 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9351 event pairs, 709 based on Foata normal form. 9/2093 useless extension candidates. Maximal degree in co-relation 5351. Up to 2043 conditions per place. [2024-06-14 15:55:11,873 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 54 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-06-14 15:55:11,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 357 flow [2024-06-14 15:55:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:55:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:55:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-14 15:55:11,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170731707317073 [2024-06-14 15:55:11,878 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 106 transitions. [2024-06-14 15:55:11,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 357 flow [2024-06-14 15:55:11,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 336 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 15:55:11,881 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 206 flow [2024-06-14 15:55:11,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-06-14 15:55:11,883 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-14 15:55:11,883 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 206 flow [2024-06-14 15:55:11,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:11,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:11,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:11,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:55:11,884 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-14 15:55:11,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1721699886, now seen corresponding path program 1 times [2024-06-14 15:55:11,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:11,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945427761] [2024-06-14 15:55:11,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:15,639 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-14 15:55:15,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:15,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945427761] [2024-06-14 15:55:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945427761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:15,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:15,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:55:15,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213789333] [2024-06-14 15:55:15,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:15,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:55:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:15,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:55:15,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:55:15,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:55:15,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:15,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:15,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:55:15,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:16,569 INFO L124 PetriNetUnfolderBase]: 1393/2098 cut-off events. [2024-06-14 15:55:16,569 INFO L125 PetriNetUnfolderBase]: For 1918/1937 co-relation queries the response was YES. [2024-06-14 15:55:16,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5951 conditions, 2098 events. 1393/2098 cut-off events. For 1918/1937 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9437 event pairs, 583 based on Foata normal form. 17/2112 useless extension candidates. Maximal degree in co-relation 5931. Up to 1989 conditions per place. [2024-06-14 15:55:16,580 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 71 selfloop transitions, 20 changer transitions 0/95 dead transitions. [2024-06-14 15:55:16,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 538 flow [2024-06-14 15:55:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:55:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:55:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-14 15:55:16,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2024-06-14 15:55:16,582 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 206 flow. Second operand 6 states and 136 transitions. [2024-06-14 15:55:16,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 538 flow [2024-06-14 15:55:16,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 95 transitions, 534 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-14 15:55:16,590 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 334 flow [2024-06-14 15:55:16,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2024-06-14 15:55:16,591 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-06-14 15:55:16,591 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 334 flow [2024-06-14 15:55:16,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:16,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:16,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:16,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:55:16,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:55:16,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1833087348, now seen corresponding path program 1 times [2024-06-14 15:55:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525813885] [2024-06-14 15:55:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:20,494 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-14 15:55:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:20,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525813885] [2024-06-14 15:55:20,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525813885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:20,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:55:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879793861] [2024-06-14 15:55:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:20,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:55:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:55:20,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:55:20,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:55:20,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-14 15:55:20,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:20,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:55:20,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:21,671 INFO L124 PetriNetUnfolderBase]: 1384/2083 cut-off events. [2024-06-14 15:55:21,672 INFO L125 PetriNetUnfolderBase]: For 3567/3586 co-relation queries the response was YES. [2024-06-14 15:55:21,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 2083 events. 1384/2083 cut-off events. For 3567/3586 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9297 event pairs, 447 based on Foata normal form. 18/2098 useless extension candidates. Maximal degree in co-relation 6944. Up to 1994 conditions per place. [2024-06-14 15:55:21,688 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 77 selfloop transitions, 15 changer transitions 0/96 dead transitions. [2024-06-14 15:55:21,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 620 flow [2024-06-14 15:55:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:55:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:55:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-14 15:55:21,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-14 15:55:21,692 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 334 flow. Second operand 7 states and 140 transitions. [2024-06-14 15:55:21,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 620 flow [2024-06-14 15:55:21,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 96 transitions, 606 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-14 15:55:21,697 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 387 flow [2024-06-14 15:55:21,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=387, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-14 15:55:21,698 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-14 15:55:21,698 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 387 flow [2024-06-14 15:55:21,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-14 15:55:21,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:21,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:21,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:55:21,699 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-14 15:55:21,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1504971726, now seen corresponding path program 1 times [2024-06-14 15:55:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612262050] [2024-06-14 15:55:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:29,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-14 15:55:29,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:29,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612262050] [2024-06-14 15:55:29,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612262050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:29,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:55:29,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445666325] [2024-06-14 15:55:29,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:29,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:55:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:29,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:55:29,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:55:29,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:55:29,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:29,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:29,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:55:29,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:30,756 INFO L124 PetriNetUnfolderBase]: 1613/2412 cut-off events. [2024-06-14 15:55:30,756 INFO L125 PetriNetUnfolderBase]: For 5248/5248 co-relation queries the response was YES. [2024-06-14 15:55:30,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8369 conditions, 2412 events. 1613/2412 cut-off events. For 5248/5248 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10974 event pairs, 567 based on Foata normal form. 6/2416 useless extension candidates. Maximal degree in co-relation 8339. Up to 2357 conditions per place. [2024-06-14 15:55:30,769 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 66 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2024-06-14 15:55:30,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 595 flow [2024-06-14 15:55:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:55:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:55:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-14 15:55:30,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-14 15:55:30,771 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 387 flow. Second operand 5 states and 86 transitions. [2024-06-14 15:55:30,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 595 flow [2024-06-14 15:55:30,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 562 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:55:30,775 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 415 flow [2024-06-14 15:55:30,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-06-14 15:55:30,776 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-14 15:55:30,776 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 415 flow [2024-06-14 15:55:30,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:30,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:30,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:30,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:55:30,777 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-14 15:55:30,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash 948681495, now seen corresponding path program 1 times [2024-06-14 15:55:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215356085] [2024-06-14 15:55:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:37,769 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-14 15:55:37,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:37,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215356085] [2024-06-14 15:55:37,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215356085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:37,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:37,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:55:37,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433107753] [2024-06-14 15:55:37,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:37,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:55:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:55:37,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:55:37,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:55:37,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 415 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:37,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:37,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:55:37,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:38,846 INFO L124 PetriNetUnfolderBase]: 1548/2328 cut-off events. [2024-06-14 15:55:38,847 INFO L125 PetriNetUnfolderBase]: For 7938/7988 co-relation queries the response was YES. [2024-06-14 15:55:38,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8890 conditions, 2328 events. 1548/2328 cut-off events. For 7938/7988 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10693 event pairs, 587 based on Foata normal form. 14/2290 useless extension candidates. Maximal degree in co-relation 8858. Up to 2198 conditions per place. [2024-06-14 15:55:38,870 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 74 selfloop transitions, 21 changer transitions 0/100 dead transitions. [2024-06-14 15:55:38,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 749 flow [2024-06-14 15:55:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:55:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:55:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 15:55:38,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-14 15:55:38,875 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 415 flow. Second operand 7 states and 127 transitions. [2024-06-14 15:55:38,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 749 flow [2024-06-14 15:55:38,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 718 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:55:38,884 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 492 flow [2024-06-14 15:55:38,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2024-06-14 15:55:38,886 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2024-06-14 15:55:38,886 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 492 flow [2024-06-14 15:55:38,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:38,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:38,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:38,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:55:38,887 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-14 15:55:38,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash 948801651, now seen corresponding path program 1 times [2024-06-14 15:55:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:38,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605918613] [2024-06-14 15:55:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:46,246 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-14 15:55:46,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:46,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605918613] [2024-06-14 15:55:46,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605918613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:46,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:46,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:55:46,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173376144] [2024-06-14 15:55:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:46,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:55:46,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:55:46,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:55:46,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:55:46,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 492 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:46,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:46,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:55:46,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:47,270 INFO L124 PetriNetUnfolderBase]: 1719/2563 cut-off events. [2024-06-14 15:55:47,271 INFO L125 PetriNetUnfolderBase]: For 9327/9329 co-relation queries the response was YES. [2024-06-14 15:55:47,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10135 conditions, 2563 events. 1719/2563 cut-off events. For 9327/9329 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11693 event pairs, 522 based on Foata normal form. 8/2569 useless extension candidates. Maximal degree in co-relation 10102. Up to 2414 conditions per place. [2024-06-14 15:55:47,286 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 95 selfloop transitions, 28 changer transitions 0/126 dead transitions. [2024-06-14 15:55:47,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 126 transitions, 997 flow [2024-06-14 15:55:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:55:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:55:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 15:55:47,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-14 15:55:47,287 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 492 flow. Second operand 8 states and 139 transitions. [2024-06-14 15:55:47,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 126 transitions, 997 flow [2024-06-14 15:55:47,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 956 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 15:55:47,296 INFO L231 Difference]: Finished difference. Result has 79 places, 95 transitions, 720 flow [2024-06-14 15:55:47,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=720, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2024-06-14 15:55:47,297 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-14 15:55:47,297 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 95 transitions, 720 flow [2024-06-14 15:55:47,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:47,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:47,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:47,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:55:47,304 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-14 15:55:47,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash 948801465, now seen corresponding path program 2 times [2024-06-14 15:55:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107402954] [2024-06-14 15:55:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:54,392 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-14 15:55:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:54,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107402954] [2024-06-14 15:55:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107402954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:55:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771902474] [2024-06-14 15:55:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:54,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:55:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:55:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:55:54,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:55:54,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 95 transitions, 720 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:54,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:54,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:55:54,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:55,379 INFO L124 PetriNetUnfolderBase]: 1697/2548 cut-off events. [2024-06-14 15:55:55,380 INFO L125 PetriNetUnfolderBase]: For 12441/12461 co-relation queries the response was YES. [2024-06-14 15:55:55,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11147 conditions, 2548 events. 1697/2548 cut-off events. For 12441/12461 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11654 event pairs, 532 based on Foata normal form. 15/2550 useless extension candidates. Maximal degree in co-relation 11109. Up to 2406 conditions per place. [2024-06-14 15:55:55,395 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 27 changer transitions 0/123 dead transitions. [2024-06-14 15:55:55,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 123 transitions, 1059 flow [2024-06-14 15:55:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:55:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:55:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-14 15:55:55,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-14 15:55:55,397 INFO L175 Difference]: Start difference. First operand has 79 places, 95 transitions, 720 flow. Second operand 7 states and 121 transitions. [2024-06-14 15:55:55,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 123 transitions, 1059 flow [2024-06-14 15:55:55,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 123 transitions, 1021 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-14 15:55:55,409 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 808 flow [2024-06-14 15:55:55,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2024-06-14 15:55:55,410 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-06-14 15:55:55,410 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 808 flow [2024-06-14 15:55:55,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:55,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:55,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:55,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:55:55,411 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-14 15:55:55,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash 483946513, now seen corresponding path program 2 times [2024-06-14 15:55:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804245474] [2024-06-14 15:55:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:01,993 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-14 15:56:01,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804245474] [2024-06-14 15:56:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804245474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:56:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942220096] [2024-06-14 15:56:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:56:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:56:01,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:56:02,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:56:02,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 808 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:02,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:02,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:56:02,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:02,982 INFO L124 PetriNetUnfolderBase]: 1762/2625 cut-off events. [2024-06-14 15:56:02,983 INFO L125 PetriNetUnfolderBase]: For 13891/13895 co-relation queries the response was YES. [2024-06-14 15:56:02,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11762 conditions, 2625 events. 1762/2625 cut-off events. For 13891/13895 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11887 event pairs, 600 based on Foata normal form. 5/2628 useless extension candidates. Maximal degree in co-relation 11722. Up to 2500 conditions per place. [2024-06-14 15:56:03,024 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 116 selfloop transitions, 23 changer transitions 0/142 dead transitions. [2024-06-14 15:56:03,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 142 transitions, 1366 flow [2024-06-14 15:56:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:56:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:56:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-14 15:56:03,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-14 15:56:03,027 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 808 flow. Second operand 6 states and 107 transitions. [2024-06-14 15:56:03,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 142 transitions, 1366 flow [2024-06-14 15:56:03,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 142 transitions, 1280 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 15:56:03,047 INFO L231 Difference]: Finished difference. Result has 88 places, 117 transitions, 980 flow [2024-06-14 15:56:03,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=88, PETRI_TRANSITIONS=117} [2024-06-14 15:56:03,050 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2024-06-14 15:56:03,050 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 117 transitions, 980 flow [2024-06-14 15:56:03,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:03,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:03,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:03,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:56:03,051 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-14 15:56:03,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:03,052 INFO L85 PathProgramCache]: Analyzing trace with hash 483946327, now seen corresponding path program 3 times [2024-06-14 15:56:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:03,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779694325] [2024-06-14 15:56:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:10,044 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-14 15:56:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:10,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779694325] [2024-06-14 15:56:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779694325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:10,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:10,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:56:10,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117096873] [2024-06-14 15:56:10,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:10,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:56:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:10,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:56:10,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:56:10,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:56:10,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 117 transitions, 980 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:10,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:10,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:56:10,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:11,139 INFO L124 PetriNetUnfolderBase]: 1676/2518 cut-off events. [2024-06-14 15:56:11,140 INFO L125 PetriNetUnfolderBase]: For 18245/18362 co-relation queries the response was YES. [2024-06-14 15:56:11,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11938 conditions, 2518 events. 1676/2518 cut-off events. For 18245/18362 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11538 event pairs, 552 based on Foata normal form. 22/2487 useless extension candidates. Maximal degree in co-relation 11895. Up to 2369 conditions per place. [2024-06-14 15:56:11,176 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 98 selfloop transitions, 29 changer transitions 0/138 dead transitions. [2024-06-14 15:56:11,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 1288 flow [2024-06-14 15:56:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:56:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:56:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-14 15:56:11,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-14 15:56:11,187 INFO L175 Difference]: Start difference. First operand has 88 places, 117 transitions, 980 flow. Second operand 6 states and 110 transitions. [2024-06-14 15:56:11,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 1288 flow [2024-06-14 15:56:11,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 138 transitions, 1266 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-14 15:56:11,210 INFO L231 Difference]: Finished difference. Result has 93 places, 117 transitions, 1032 flow [2024-06-14 15:56:11,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1032, PETRI_PLACES=93, PETRI_TRANSITIONS=117} [2024-06-14 15:56:11,211 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-14 15:56:11,211 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 117 transitions, 1032 flow [2024-06-14 15:56:11,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:11,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:11,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:11,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:56:11,212 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-14 15:56:11,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash 484183663, now seen corresponding path program 3 times [2024-06-14 15:56:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664943103] [2024-06-14 15:56:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:17,665 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-14 15:56:17,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:17,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664943103] [2024-06-14 15:56:17,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664943103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:17,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:17,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:56:17,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197040226] [2024-06-14 15:56:17,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:17,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:56:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:17,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:56:17,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:56:17,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:56:17,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 117 transitions, 1032 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:17,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:17,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:56:17,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:18,628 INFO L124 PetriNetUnfolderBase]: 1754/2614 cut-off events. [2024-06-14 15:56:18,628 INFO L125 PetriNetUnfolderBase]: For 18352/18356 co-relation queries the response was YES. [2024-06-14 15:56:18,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12350 conditions, 2614 events. 1754/2614 cut-off events. For 18352/18356 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11851 event pairs, 611 based on Foata normal form. 10/2622 useless extension candidates. Maximal degree in co-relation 12304. Up to 2547 conditions per place. [2024-06-14 15:56:18,644 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 113 selfloop transitions, 21 changer transitions 0/137 dead transitions. [2024-06-14 15:56:18,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1391 flow [2024-06-14 15:56:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:56:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:56:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-14 15:56:18,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-14 15:56:18,647 INFO L175 Difference]: Start difference. First operand has 93 places, 117 transitions, 1032 flow. Second operand 6 states and 101 transitions. [2024-06-14 15:56:18,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1391 flow [2024-06-14 15:56:18,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 137 transitions, 1315 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:56:18,669 INFO L231 Difference]: Finished difference. Result has 94 places, 121 transitions, 1067 flow [2024-06-14 15:56:18,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1067, PETRI_PLACES=94, PETRI_TRANSITIONS=121} [2024-06-14 15:56:18,670 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-14 15:56:18,671 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 1067 flow [2024-06-14 15:56:18,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:18,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:18,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:18,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:56:18,671 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-14 15:56:18,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 484192591, now seen corresponding path program 1 times [2024-06-14 15:56:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:18,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675330287] [2024-06-14 15:56:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:27,192 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-14 15:56:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:27,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675330287] [2024-06-14 15:56:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675330287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:27,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:27,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:56:27,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062760810] [2024-06-14 15:56:27,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:27,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:56:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:27,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:56:27,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:56:27,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:56:27,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 1067 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:27,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:27,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:56:27,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:28,318 INFO L124 PetriNetUnfolderBase]: 1754/2614 cut-off events. [2024-06-14 15:56:28,318 INFO L125 PetriNetUnfolderBase]: For 20776/20780 co-relation queries the response was YES. [2024-06-14 15:56:28,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12527 conditions, 2614 events. 1754/2614 cut-off events. For 20776/20780 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11830 event pairs, 592 based on Foata normal form. 10/2622 useless extension candidates. Maximal degree in co-relation 12480. Up to 2535 conditions per place. [2024-06-14 15:56:28,335 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 117 selfloop transitions, 20 changer transitions 0/140 dead transitions. [2024-06-14 15:56:28,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 140 transitions, 1413 flow [2024-06-14 15:56:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:56:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:56:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-14 15:56:28,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-14 15:56:28,357 INFO L175 Difference]: Start difference. First operand has 94 places, 121 transitions, 1067 flow. Second operand 6 states and 101 transitions. [2024-06-14 15:56:28,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 140 transitions, 1413 flow [2024-06-14 15:56:28,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 1355 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-14 15:56:28,379 INFO L231 Difference]: Finished difference. Result has 96 places, 124 transitions, 1095 flow [2024-06-14 15:56:28,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=96, PETRI_TRANSITIONS=124} [2024-06-14 15:56:28,380 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-14 15:56:28,380 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 124 transitions, 1095 flow [2024-06-14 15:56:28,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:28,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:28,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:28,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:56:28,380 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-14 15:56:28,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash -655734212, now seen corresponding path program 1 times [2024-06-14 15:56:28,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:28,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221859989] [2024-06-14 15:56:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:36,204 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-14 15:56:36,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221859989] [2024-06-14 15:56:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221859989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:36,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:56:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331973415] [2024-06-14 15:56:36,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:36,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:56:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:36,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:56:36,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:56:36,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:56:36,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 124 transitions, 1095 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:56:36,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:36,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:56:36,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:37,486 INFO L124 PetriNetUnfolderBase]: 1687/2534 cut-off events. [2024-06-14 15:56:37,487 INFO L125 PetriNetUnfolderBase]: For 26485/26650 co-relation queries the response was YES. [2024-06-14 15:56:37,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12949 conditions, 2534 events. 1687/2534 cut-off events. For 26485/26650 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11646 event pairs, 531 based on Foata normal form. 52/2534 useless extension candidates. Maximal degree in co-relation 12901. Up to 2307 conditions per place. [2024-06-14 15:56:37,503 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 105 selfloop transitions, 50 changer transitions 0/168 dead transitions. [2024-06-14 15:56:37,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 168 transitions, 1617 flow [2024-06-14 15:56:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:56:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:56:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 15:56:37,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-14 15:56:37,506 INFO L175 Difference]: Start difference. First operand has 96 places, 124 transitions, 1095 flow. Second operand 9 states and 161 transitions. [2024-06-14 15:56:37,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 168 transitions, 1617 flow [2024-06-14 15:56:37,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 168 transitions, 1555 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 15:56:37,531 INFO L231 Difference]: Finished difference. Result has 101 places, 130 transitions, 1212 flow [2024-06-14 15:56:37,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1212, PETRI_PLACES=101, PETRI_TRANSITIONS=130} [2024-06-14 15:56:37,532 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-14 15:56:37,532 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 130 transitions, 1212 flow [2024-06-14 15:56:37,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:56:37,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:37,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:37,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:56:37,533 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-14 15:56:37,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:37,533 INFO L85 PathProgramCache]: Analyzing trace with hash -655643847, now seen corresponding path program 1 times [2024-06-14 15:56:37,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:37,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484914946] [2024-06-14 15:56:37,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:37,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:44,465 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-14 15:56:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484914946] [2024-06-14 15:56:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484914946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:44,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:44,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:56:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227435831] [2024-06-14 15:56:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:44,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:56:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:44,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:56:44,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:56:44,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:56:44,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 130 transitions, 1212 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:44,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:44,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:56:44,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:45,669 INFO L124 PetriNetUnfolderBase]: 1854/2756 cut-off events. [2024-06-14 15:56:45,670 INFO L125 PetriNetUnfolderBase]: For 28366/28370 co-relation queries the response was YES. [2024-06-14 15:56:45,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14286 conditions, 2756 events. 1854/2756 cut-off events. For 28366/28370 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12493 event pairs, 547 based on Foata normal form. 10/2764 useless extension candidates. Maximal degree in co-relation 14237. Up to 2434 conditions per place. [2024-06-14 15:56:45,684 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 125 selfloop transitions, 63 changer transitions 0/191 dead transitions. [2024-06-14 15:56:45,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 191 transitions, 1995 flow [2024-06-14 15:56:45,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:56:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:56:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 15:56:45,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-14 15:56:45,686 INFO L175 Difference]: Start difference. First operand has 101 places, 130 transitions, 1212 flow. Second operand 9 states and 161 transitions. [2024-06-14 15:56:45,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 191 transitions, 1995 flow [2024-06-14 15:56:45,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 191 transitions, 1901 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 15:56:45,709 INFO L231 Difference]: Finished difference. Result has 107 places, 149 transitions, 1510 flow [2024-06-14 15:56:45,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1510, PETRI_PLACES=107, PETRI_TRANSITIONS=149} [2024-06-14 15:56:45,710 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-14 15:56:45,710 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 149 transitions, 1510 flow [2024-06-14 15:56:45,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:45,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:45,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:45,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:56:45,711 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-14 15:56:45,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -651924777, now seen corresponding path program 2 times [2024-06-14 15:56:45,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804690999] [2024-06-14 15:56:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:52,702 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-14 15:56:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:52,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804690999] [2024-06-14 15:56:52,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804690999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:52,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:52,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:56:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962506172] [2024-06-14 15:56:52,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:52,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:56:52,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:52,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:56:52,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:56:52,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:56:52,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 149 transitions, 1510 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:52,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:52,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:56:52,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:53,919 INFO L124 PetriNetUnfolderBase]: 1934/2870 cut-off events. [2024-06-14 15:56:53,920 INFO L125 PetriNetUnfolderBase]: For 34034/34038 co-relation queries the response was YES. [2024-06-14 15:56:53,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15984 conditions, 2870 events. 1934/2870 cut-off events. For 34034/34038 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13031 event pairs, 562 based on Foata normal form. 10/2878 useless extension candidates. Maximal degree in co-relation 15931. Up to 2634 conditions per place. [2024-06-14 15:56:53,940 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 137 selfloop transitions, 56 changer transitions 0/196 dead transitions. [2024-06-14 15:56:53,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 196 transitions, 2210 flow [2024-06-14 15:56:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:56:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:56:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-14 15:56:53,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-14 15:56:53,952 INFO L175 Difference]: Start difference. First operand has 107 places, 149 transitions, 1510 flow. Second operand 9 states and 159 transitions. [2024-06-14 15:56:53,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 196 transitions, 2210 flow [2024-06-14 15:56:53,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 196 transitions, 2096 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-14 15:56:53,990 INFO L231 Difference]: Finished difference. Result has 113 places, 158 transitions, 1656 flow [2024-06-14 15:56:53,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1656, PETRI_PLACES=113, PETRI_TRANSITIONS=158} [2024-06-14 15:56:53,991 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-14 15:56:53,991 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 158 transitions, 1656 flow [2024-06-14 15:56:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:53,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:53,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:53,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:56:53,991 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-14 15:56:53,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -651924932, now seen corresponding path program 2 times [2024-06-14 15:56:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:53,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481542617] [2024-06-14 15:56:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:53,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:01,824 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-14 15:57:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:01,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481542617] [2024-06-14 15:57:01,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481542617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:01,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:01,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554737610] [2024-06-14 15:57:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:01,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:01,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:01,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:57:01,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 158 transitions, 1656 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:57:01,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:01,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:57:01,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:03,020 INFO L124 PetriNetUnfolderBase]: 1901/2836 cut-off events. [2024-06-14 15:57:03,020 INFO L125 PetriNetUnfolderBase]: For 42906/43081 co-relation queries the response was YES. [2024-06-14 15:57:03,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16712 conditions, 2836 events. 1901/2836 cut-off events. For 42906/43081 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13121 event pairs, 537 based on Foata normal form. 11/2794 useless extension candidates. Maximal degree in co-relation 16656. Up to 2663 conditions per place. [2024-06-14 15:57:03,040 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 129 selfloop transitions, 40 changer transitions 0/187 dead transitions. [2024-06-14 15:57:03,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 187 transitions, 2094 flow [2024-06-14 15:57:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:57:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:57:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 15:57:03,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:57:03,043 INFO L175 Difference]: Start difference. First operand has 113 places, 158 transitions, 1656 flow. Second operand 8 states and 136 transitions. [2024-06-14 15:57:03,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 187 transitions, 2094 flow [2024-06-14 15:57:03,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 187 transitions, 2006 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-14 15:57:03,087 INFO L231 Difference]: Finished difference. Result has 116 places, 161 transitions, 1697 flow [2024-06-14 15:57:03,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1697, PETRI_PLACES=116, PETRI_TRANSITIONS=161} [2024-06-14 15:57:03,087 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2024-06-14 15:57:03,087 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 161 transitions, 1697 flow [2024-06-14 15:57:03,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:57:03,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:03,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:03,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:57:03,088 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-14 15:57:03,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash -651919197, now seen corresponding path program 3 times [2024-06-14 15:57:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:03,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173172066] [2024-06-14 15:57:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:09,944 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-14 15:57:09,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173172066] [2024-06-14 15:57:09,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173172066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:09,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:09,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:09,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587445111] [2024-06-14 15:57:09,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:09,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:09,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:10,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:57:10,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 161 transitions, 1697 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:10,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:10,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:57:10,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:11,246 INFO L124 PetriNetUnfolderBase]: 1934/2871 cut-off events. [2024-06-14 15:57:11,246 INFO L125 PetriNetUnfolderBase]: For 39562/39566 co-relation queries the response was YES. [2024-06-14 15:57:11,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16530 conditions, 2871 events. 1934/2871 cut-off events. For 39562/39566 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13053 event pairs, 560 based on Foata normal form. 10/2879 useless extension candidates. Maximal degree in co-relation 16472. Up to 2644 conditions per place. [2024-06-14 15:57:11,267 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 144 selfloop transitions, 59 changer transitions 0/206 dead transitions. [2024-06-14 15:57:11,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 206 transitions, 2273 flow [2024-06-14 15:57:11,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:57:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:57:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-14 15:57:11,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41019955654101997 [2024-06-14 15:57:11,269 INFO L175 Difference]: Start difference. First operand has 116 places, 161 transitions, 1697 flow. Second operand 11 states and 185 transitions. [2024-06-14 15:57:11,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 206 transitions, 2273 flow [2024-06-14 15:57:11,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 206 transitions, 2152 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-14 15:57:11,313 INFO L231 Difference]: Finished difference. Result has 121 places, 162 transitions, 1718 flow [2024-06-14 15:57:11,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1718, PETRI_PLACES=121, PETRI_TRANSITIONS=162} [2024-06-14 15:57:11,314 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-14 15:57:11,314 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 162 transitions, 1718 flow [2024-06-14 15:57:11,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:11,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:11,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:11,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:57:11,315 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-14 15:57:11,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2125059486, now seen corresponding path program 1 times [2024-06-14 15:57:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848023734] [2024-06-14 15:57:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:18,104 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-14 15:57:18,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848023734] [2024-06-14 15:57:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848023734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:18,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219251070] [2024-06-14 15:57:18,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:18,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:18,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:57:18,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 162 transitions, 1718 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:18,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:18,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:57:18,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:19,229 INFO L124 PetriNetUnfolderBase]: 1934/2871 cut-off events. [2024-06-14 15:57:19,229 INFO L125 PetriNetUnfolderBase]: For 43059/43063 co-relation queries the response was YES. [2024-06-14 15:57:19,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16807 conditions, 2871 events. 1934/2871 cut-off events. For 43059/43063 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13120 event pairs, 574 based on Foata normal form. 7/2876 useless extension candidates. Maximal degree in co-relation 16748. Up to 2780 conditions per place. [2024-06-14 15:57:19,247 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 152 selfloop transitions, 27 changer transitions 0/182 dead transitions. [2024-06-14 15:57:19,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 2168 flow [2024-06-14 15:57:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:57:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:57:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-14 15:57:19,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:57:19,263 INFO L175 Difference]: Start difference. First operand has 121 places, 162 transitions, 1718 flow. Second operand 6 states and 102 transitions. [2024-06-14 15:57:19,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 2168 flow [2024-06-14 15:57:19,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 182 transitions, 2042 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:57:19,308 INFO L231 Difference]: Finished difference. Result has 118 places, 166 transitions, 1721 flow [2024-06-14 15:57:19,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1721, PETRI_PLACES=118, PETRI_TRANSITIONS=166} [2024-06-14 15:57:19,308 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-14 15:57:19,309 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 166 transitions, 1721 flow [2024-06-14 15:57:19,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:19,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:19,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:19,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:57:19,309 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:57:19,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2124792359, now seen corresponding path program 4 times [2024-06-14 15:57:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:19,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592351857] [2024-06-14 15:57:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:19,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:25,837 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-14 15:57:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592351857] [2024-06-14 15:57:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592351857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:25,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909037147] [2024-06-14 15:57:25,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:25,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:25,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:25,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:25,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:25,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:57:25,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 166 transitions, 1721 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:25,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:25,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:57:25,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:27,004 INFO L124 PetriNetUnfolderBase]: 1966/2917 cut-off events. [2024-06-14 15:57:27,004 INFO L125 PetriNetUnfolderBase]: For 47956/47960 co-relation queries the response was YES. [2024-06-14 15:57:27,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17531 conditions, 2917 events. 1966/2917 cut-off events. For 47956/47960 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13316 event pairs, 574 based on Foata normal form. 10/2925 useless extension candidates. Maximal degree in co-relation 17471. Up to 2819 conditions per place. [2024-06-14 15:57:27,022 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 163 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-06-14 15:57:27,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 191 transitions, 2211 flow [2024-06-14 15:57:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:57:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:57:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-14 15:57:27,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-14 15:57:27,024 INFO L175 Difference]: Start difference. First operand has 118 places, 166 transitions, 1721 flow. Second operand 7 states and 117 transitions. [2024-06-14 15:57:27,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 191 transitions, 2211 flow [2024-06-14 15:57:27,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 191 transitions, 2142 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-14 15:57:27,072 INFO L231 Difference]: Finished difference. Result has 121 places, 170 transitions, 1778 flow [2024-06-14 15:57:27,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1778, PETRI_PLACES=121, PETRI_TRANSITIONS=170} [2024-06-14 15:57:27,073 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-14 15:57:27,073 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 170 transitions, 1778 flow [2024-06-14 15:57:27,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:27,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:27,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:27,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:57:27,074 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-14 15:57:27,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2117435129, now seen corresponding path program 5 times [2024-06-14 15:57:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515356307] [2024-06-14 15:57:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:34,142 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-14 15:57:34,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:34,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515356307] [2024-06-14 15:57:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515356307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:34,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071790999] [2024-06-14 15:57:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:34,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:34,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:57:34,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 170 transitions, 1778 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:34,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:34,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:57:34,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:35,407 INFO L124 PetriNetUnfolderBase]: 1998/2963 cut-off events. [2024-06-14 15:57:35,408 INFO L125 PetriNetUnfolderBase]: For 52715/52719 co-relation queries the response was YES. [2024-06-14 15:57:35,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18109 conditions, 2963 events. 1998/2963 cut-off events. For 52715/52719 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13540 event pairs, 571 based on Foata normal form. 10/2971 useless extension candidates. Maximal degree in co-relation 18048. Up to 2712 conditions per place. [2024-06-14 15:57:35,429 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 155 selfloop transitions, 53 changer transitions 0/211 dead transitions. [2024-06-14 15:57:35,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 211 transitions, 2486 flow [2024-06-14 15:57:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:57:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:57:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-14 15:57:35,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-14 15:57:35,431 INFO L175 Difference]: Start difference. First operand has 121 places, 170 transitions, 1778 flow. Second operand 8 states and 146 transitions. [2024-06-14 15:57:35,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 211 transitions, 2486 flow [2024-06-14 15:57:35,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 211 transitions, 2404 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-14 15:57:35,485 INFO L231 Difference]: Finished difference. Result has 125 places, 175 transitions, 1907 flow [2024-06-14 15:57:35,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1907, PETRI_PLACES=125, PETRI_TRANSITIONS=175} [2024-06-14 15:57:35,485 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-14 15:57:35,485 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 175 transitions, 1907 flow [2024-06-14 15:57:35,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:35,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:35,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:35,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:57:35,486 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-14 15:57:35,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2117434974, now seen corresponding path program 3 times [2024-06-14 15:57:35,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:35,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331602575] [2024-06-14 15:57:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:42,910 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-14 15:57:42,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:42,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331602575] [2024-06-14 15:57:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331602575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:42,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051910307] [2024-06-14 15:57:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:42,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:42,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:43,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:57:43,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 175 transitions, 1907 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:57:43,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:43,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:57:43,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:44,109 INFO L124 PetriNetUnfolderBase]: 1935/2889 cut-off events. [2024-06-14 15:57:44,110 INFO L125 PetriNetUnfolderBase]: For 63415/63607 co-relation queries the response was YES. [2024-06-14 15:57:44,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18637 conditions, 2889 events. 1935/2889 cut-off events. For 63415/63607 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13424 event pairs, 534 based on Foata normal form. 20/2852 useless extension candidates. Maximal degree in co-relation 18574. Up to 2685 conditions per place. [2024-06-14 15:57:44,131 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 140 selfloop transitions, 41 changer transitions 0/203 dead transitions. [2024-06-14 15:57:44,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 203 transitions, 2341 flow [2024-06-14 15:57:44,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:57:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:57:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 15:57:44,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-14 15:57:44,135 INFO L175 Difference]: Start difference. First operand has 125 places, 175 transitions, 1907 flow. Second operand 7 states and 129 transitions. [2024-06-14 15:57:44,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 203 transitions, 2341 flow [2024-06-14 15:57:44,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 203 transitions, 2113 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-14 15:57:44,197 INFO L231 Difference]: Finished difference. Result has 125 places, 175 transitions, 1775 flow [2024-06-14 15:57:44,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1775, PETRI_PLACES=125, PETRI_TRANSITIONS=175} [2024-06-14 15:57:44,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-14 15:57:44,198 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 175 transitions, 1775 flow [2024-06-14 15:57:44,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-14 15:57:44,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:44,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:44,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:57:44,199 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-14 15:57:44,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2117440709, now seen corresponding path program 6 times [2024-06-14 15:57:44,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:44,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142794499] [2024-06-14 15:57:44,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:50,831 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-14 15:57:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142794499] [2024-06-14 15:57:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142794499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:50,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:50,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994909446] [2024-06-14 15:57:50,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:50,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:51,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:57:51,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 175 transitions, 1775 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:51,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:51,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:57:51,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:52,076 INFO L124 PetriNetUnfolderBase]: 1978/2936 cut-off events. [2024-06-14 15:57:52,076 INFO L125 PetriNetUnfolderBase]: For 58990/58994 co-relation queries the response was YES. [2024-06-14 15:57:52,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17906 conditions, 2936 events. 1978/2936 cut-off events. For 58990/58994 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13400 event pairs, 577 based on Foata normal form. 10/2944 useless extension candidates. Maximal degree in co-relation 17843. Up to 2693 conditions per place. [2024-06-14 15:57:52,098 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 154 selfloop transitions, 50 changer transitions 0/207 dead transitions. [2024-06-14 15:57:52,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 207 transitions, 2329 flow [2024-06-14 15:57:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:57:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:57:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 15:57:52,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-14 15:57:52,100 INFO L175 Difference]: Start difference. First operand has 125 places, 175 transitions, 1775 flow. Second operand 8 states and 141 transitions. [2024-06-14 15:57:52,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 207 transitions, 2329 flow [2024-06-14 15:57:52,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 207 transitions, 2210 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 15:57:52,162 INFO L231 Difference]: Finished difference. Result has 128 places, 177 transitions, 1817 flow [2024-06-14 15:57:52,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1817, PETRI_PLACES=128, PETRI_TRANSITIONS=177} [2024-06-14 15:57:52,163 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-14 15:57:52,163 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 177 transitions, 1817 flow [2024-06-14 15:57:52,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:52,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:52,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:52,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:57:52,163 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:57:52,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1473524437, now seen corresponding path program 1 times [2024-06-14 15:57:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:52,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646791033] [2024-06-14 15:57:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:03,383 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-14 15:58:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646791033] [2024-06-14 15:58:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646791033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:03,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:03,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:58:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342993294] [2024-06-14 15:58:03,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:03,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:58:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:58:03,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:58:03,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:58:03,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 177 transitions, 1817 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-14 15:58:03,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:03,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:58:03,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:04,539 INFO L124 PetriNetUnfolderBase]: 1903/2845 cut-off events. [2024-06-14 15:58:04,540 INFO L125 PetriNetUnfolderBase]: For 62818/62827 co-relation queries the response was YES. [2024-06-14 15:58:04,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17848 conditions, 2845 events. 1903/2845 cut-off events. For 62818/62827 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13034 event pairs, 561 based on Foata normal form. 13/2846 useless extension candidates. Maximal degree in co-relation 17783. Up to 2745 conditions per place. [2024-06-14 15:58:04,575 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 160 selfloop transitions, 14 changer transitions 0/189 dead transitions. [2024-06-14 15:58:04,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 189 transitions, 2211 flow [2024-06-14 15:58:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:58:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:58:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-06-14 15:58:04,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097560975609756 [2024-06-14 15:58:04,577 INFO L175 Difference]: Start difference. First operand has 128 places, 177 transitions, 1817 flow. Second operand 5 states and 84 transitions. [2024-06-14 15:58:04,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 189 transitions, 2211 flow [2024-06-14 15:58:04,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 189 transitions, 2131 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 15:58:04,676 INFO L231 Difference]: Finished difference. Result has 129 places, 180 transitions, 1804 flow [2024-06-14 15:58:04,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1737, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1804, PETRI_PLACES=129, PETRI_TRANSITIONS=180} [2024-06-14 15:58:04,676 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-14 15:58:04,677 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 180 transitions, 1804 flow [2024-06-14 15:58:04,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-14 15:58:04,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:04,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:04,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:58:04,677 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-14 15:58:04,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1341313866, now seen corresponding path program 1 times [2024-06-14 15:58:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:04,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848682188] [2024-06-14 15:58:04,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:12,623 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-14 15:58:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848682188] [2024-06-14 15:58:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848682188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:12,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:12,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:58:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734035099] [2024-06-14 15:58:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:12,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:58:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:12,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:58:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:58:12,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:58:12,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 180 transitions, 1804 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-14 15:58:12,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:12,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:58:12,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:13,966 INFO L124 PetriNetUnfolderBase]: 1928/2884 cut-off events. [2024-06-14 15:58:13,966 INFO L125 PetriNetUnfolderBase]: For 75864/76084 co-relation queries the response was YES. [2024-06-14 15:58:13,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18744 conditions, 2884 events. 1928/2884 cut-off events. For 75864/76084 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13422 event pairs, 388 based on Foata normal form. 21/2848 useless extension candidates. Maximal degree in co-relation 18678. Up to 2511 conditions per place. [2024-06-14 15:58:13,990 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 132 selfloop transitions, 69 changer transitions 0/224 dead transitions. [2024-06-14 15:58:13,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 224 transitions, 2476 flow [2024-06-14 15:58:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:58:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:58:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-14 15:58:13,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:58:13,994 INFO L175 Difference]: Start difference. First operand has 129 places, 180 transitions, 1804 flow. Second operand 9 states and 162 transitions. [2024-06-14 15:58:13,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 224 transitions, 2476 flow [2024-06-14 15:58:14,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 224 transitions, 2439 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 15:58:14,104 INFO L231 Difference]: Finished difference. Result has 135 places, 184 transitions, 1992 flow [2024-06-14 15:58:14,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1767, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1992, PETRI_PLACES=135, PETRI_TRANSITIONS=184} [2024-06-14 15:58:14,105 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-14 15:58:14,105 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 184 transitions, 1992 flow [2024-06-14 15:58:14,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-14 15:58:14,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:14,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:14,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:58:14,106 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-14 15:58:14,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1341253292, now seen corresponding path program 1 times [2024-06-14 15:58:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234526878] [2024-06-14 15:58:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:22,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-14 15:58:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234526878] [2024-06-14 15:58:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234526878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:58:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149575985] [2024-06-14 15:58:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:22,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:58:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:58:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:58:22,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:58:22,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 184 transitions, 1992 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:58:22,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:22,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:58:22,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:24,057 INFO L124 PetriNetUnfolderBase]: 2075/3078 cut-off events. [2024-06-14 15:58:24,057 INFO L125 PetriNetUnfolderBase]: For 74824/74828 co-relation queries the response was YES. [2024-06-14 15:58:24,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19857 conditions, 3078 events. 2075/3078 cut-off events. For 74824/74828 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14179 event pairs, 468 based on Foata normal form. 10/3086 useless extension candidates. Maximal degree in co-relation 19790. Up to 2485 conditions per place. [2024-06-14 15:58:24,084 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 158 selfloop transitions, 100 changer transitions 0/261 dead transitions. [2024-06-14 15:58:24,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 261 transitions, 3050 flow [2024-06-14 15:58:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:58:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:58:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-06-14 15:58:24,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-14 15:58:24,094 INFO L175 Difference]: Start difference. First operand has 135 places, 184 transitions, 1992 flow. Second operand 12 states and 213 transitions. [2024-06-14 15:58:24,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 261 transitions, 3050 flow [2024-06-14 15:58:24,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 261 transitions, 2922 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 15:58:24,182 INFO L231 Difference]: Finished difference. Result has 144 places, 203 transitions, 2361 flow [2024-06-14 15:58:24,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2361, PETRI_PLACES=144, PETRI_TRANSITIONS=203} [2024-06-14 15:58:24,184 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 102 predicate places. [2024-06-14 15:58:24,184 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 203 transitions, 2361 flow [2024-06-14 15:58:24,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:58:24,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:24,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:24,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:58:24,185 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-14 15:58:24,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1147076664, now seen corresponding path program 2 times [2024-06-14 15:58:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004819812] [2024-06-14 15:58:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:31,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:31,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004819812] [2024-06-14 15:58:31,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004819812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:31,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:31,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:58:31,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942190668] [2024-06-14 15:58:31,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:31,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:58:31,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:31,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:58:31,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:58:32,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:58:32,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 203 transitions, 2361 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-14 15:58:32,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:32,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:58:32,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:33,454 INFO L124 PetriNetUnfolderBase]: 2032/3035 cut-off events. [2024-06-14 15:58:33,455 INFO L125 PetriNetUnfolderBase]: For 90796/90932 co-relation queries the response was YES. [2024-06-14 15:58:33,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21170 conditions, 3035 events. 2032/3035 cut-off events. For 90796/90932 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14213 event pairs, 498 based on Foata normal form. 9/2986 useless extension candidates. Maximal degree in co-relation 21099. Up to 2713 conditions per place. [2024-06-14 15:58:33,478 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 142 selfloop transitions, 78 changer transitions 0/246 dead transitions. [2024-06-14 15:58:33,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 246 transitions, 2939 flow [2024-06-14 15:58:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:58:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:58:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-14 15:58:33,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-14 15:58:33,480 INFO L175 Difference]: Start difference. First operand has 144 places, 203 transitions, 2361 flow. Second operand 10 states and 174 transitions. [2024-06-14 15:58:33,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 246 transitions, 2939 flow [2024-06-14 15:58:33,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 246 transitions, 2754 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-14 15:58:33,564 INFO L231 Difference]: Finished difference. Result has 147 places, 205 transitions, 2378 flow [2024-06-14 15:58:33,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2378, PETRI_PLACES=147, PETRI_TRANSITIONS=205} [2024-06-14 15:58:33,564 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-14 15:58:33,564 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 205 transitions, 2378 flow [2024-06-14 15:58:33,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-14 15:58:33,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:33,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:33,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:58:33,565 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-14 15:58:33,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1265169118, now seen corresponding path program 2 times [2024-06-14 15:58:33,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:33,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363663459] [2024-06-14 15:58:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:41,865 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-14 15:58:41,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363663459] [2024-06-14 15:58:41,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363663459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:41,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:41,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:58:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826200573] [2024-06-14 15:58:41,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:41,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:58:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:58:41,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:58:41,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:58:41,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 205 transitions, 2378 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:58:41,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:41,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:58:41,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:43,286 INFO L124 PetriNetUnfolderBase]: 2132/3163 cut-off events. [2024-06-14 15:58:43,286 INFO L125 PetriNetUnfolderBase]: For 86244/86248 co-relation queries the response was YES. [2024-06-14 15:58:43,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21572 conditions, 3163 events. 2132/3163 cut-off events. For 86244/86248 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14615 event pairs, 500 based on Foata normal form. 10/3171 useless extension candidates. Maximal degree in co-relation 21499. Up to 2905 conditions per place. [2024-06-14 15:58:43,311 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 185 selfloop transitions, 61 changer transitions 0/249 dead transitions. [2024-06-14 15:58:43,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 249 transitions, 3086 flow [2024-06-14 15:58:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:58:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:58:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-14 15:58:43,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219512195121951 [2024-06-14 15:58:43,313 INFO L175 Difference]: Start difference. First operand has 147 places, 205 transitions, 2378 flow. Second operand 10 states and 173 transitions. [2024-06-14 15:58:43,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 249 transitions, 3086 flow [2024-06-14 15:58:43,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 249 transitions, 2908 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:58:43,416 INFO L231 Difference]: Finished difference. Result has 149 places, 209 transitions, 2393 flow [2024-06-14 15:58:43,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2393, PETRI_PLACES=149, PETRI_TRANSITIONS=209} [2024-06-14 15:58:43,417 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-14 15:58:43,417 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 209 transitions, 2393 flow [2024-06-14 15:58:43,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:58:43,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:43,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:43,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:58:43,418 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-14 15:58:43,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1265342098, now seen corresponding path program 3 times [2024-06-14 15:58:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770574898] [2024-06-14 15:58:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:52,009 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-14 15:58:52,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:52,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770574898] [2024-06-14 15:58:52,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770574898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:52,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:52,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:58:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618279192] [2024-06-14 15:58:52,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:52,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:58:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:52,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:58:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:58:52,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:58:52,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 209 transitions, 2393 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:58:52,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:52,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:58:52,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:53,518 INFO L124 PetriNetUnfolderBase]: 2164/3209 cut-off events. [2024-06-14 15:58:53,518 INFO L125 PetriNetUnfolderBase]: For 92787/92791 co-relation queries the response was YES. [2024-06-14 15:58:53,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22079 conditions, 3209 events. 2164/3209 cut-off events. For 92787/92791 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14851 event pairs, 502 based on Foata normal form. 10/3217 useless extension candidates. Maximal degree in co-relation 22005. Up to 2951 conditions per place. [2024-06-14 15:58:53,547 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 195 selfloop transitions, 63 changer transitions 0/261 dead transitions. [2024-06-14 15:58:53,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 261 transitions, 3155 flow [2024-06-14 15:58:53,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:58:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:58:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 201 transitions. [2024-06-14 15:58:53,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-14 15:58:53,548 INFO L175 Difference]: Start difference. First operand has 149 places, 209 transitions, 2393 flow. Second operand 12 states and 201 transitions. [2024-06-14 15:58:53,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 261 transitions, 3155 flow [2024-06-14 15:58:53,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 261 transitions, 3004 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:58:53,661 INFO L231 Difference]: Finished difference. Result has 153 places, 213 transitions, 2447 flow [2024-06-14 15:58:53,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2447, PETRI_PLACES=153, PETRI_TRANSITIONS=213} [2024-06-14 15:58:53,662 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places. [2024-06-14 15:58:53,662 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 213 transitions, 2447 flow [2024-06-14 15:58:53,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:58:53,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:53,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:53,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:58:53,663 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-14 15:58:53,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1265164344, now seen corresponding path program 3 times [2024-06-14 15:58:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:53,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213326601] [2024-06-14 15:58:53,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:53,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:00,163 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-14 15:59:00,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:00,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213326601] [2024-06-14 15:59:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213326601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:00,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421472568] [2024-06-14 15:59:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:00,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:00,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:59:00,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 213 transitions, 2447 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-14 15:59:00,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:00,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:59:00,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:01,735 INFO L124 PetriNetUnfolderBase]: 2217/3308 cut-off events. [2024-06-14 15:59:01,735 INFO L125 PetriNetUnfolderBase]: For 119035/119214 co-relation queries the response was YES. [2024-06-14 15:59:01,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23510 conditions, 3308 events. 2217/3308 cut-off events. For 119035/119214 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15728 event pairs, 517 based on Foata normal form. 32/3279 useless extension candidates. Maximal degree in co-relation 23435. Up to 2934 conditions per place. [2024-06-14 15:59:01,763 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 187 selfloop transitions, 56 changer transitions 0/271 dead transitions. [2024-06-14 15:59:01,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 271 transitions, 3389 flow [2024-06-14 15:59:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:59:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:59:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-14 15:59:01,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-14 15:59:01,765 INFO L175 Difference]: Start difference. First operand has 153 places, 213 transitions, 2447 flow. Second operand 9 states and 169 transitions. [2024-06-14 15:59:01,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 271 transitions, 3389 flow [2024-06-14 15:59:01,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 271 transitions, 3226 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-14 15:59:01,868 INFO L231 Difference]: Finished difference. Result has 154 places, 229 transitions, 2623 flow [2024-06-14 15:59:01,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2623, PETRI_PLACES=154, PETRI_TRANSITIONS=229} [2024-06-14 15:59:01,869 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-14 15:59:01,869 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 229 transitions, 2623 flow [2024-06-14 15:59:01,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-14 15:59:01,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:01,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:01,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:59:01,870 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-14 15:59:01,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1265349042, now seen corresponding path program 1 times [2024-06-14 15:59:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933371446] [2024-06-14 15:59:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:09,068 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-14 15:59:09,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933371446] [2024-06-14 15:59:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933371446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:09,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:09,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:09,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005067287] [2024-06-14 15:59:09,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:09,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:09,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:09,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:09,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:09,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:59:09,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 229 transitions, 2623 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:09,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:09,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:59:09,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:10,390 INFO L124 PetriNetUnfolderBase]: 2301/3418 cut-off events. [2024-06-14 15:59:10,391 INFO L125 PetriNetUnfolderBase]: For 114221/114225 co-relation queries the response was YES. [2024-06-14 15:59:10,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24322 conditions, 3418 events. 2301/3418 cut-off events. For 114221/114225 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16061 event pairs, 535 based on Foata normal form. 5/3421 useless extension candidates. Maximal degree in co-relation 24244. Up to 3281 conditions per place. [2024-06-14 15:59:10,417 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 234 selfloop transitions, 26 changer transitions 0/263 dead transitions. [2024-06-14 15:59:10,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 263 transitions, 3284 flow [2024-06-14 15:59:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:59:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:59:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-14 15:59:10,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-14 15:59:10,420 INFO L175 Difference]: Start difference. First operand has 154 places, 229 transitions, 2623 flow. Second operand 8 states and 133 transitions. [2024-06-14 15:59:10,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 263 transitions, 3284 flow [2024-06-14 15:59:10,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 263 transitions, 3214 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-14 15:59:10,549 INFO L231 Difference]: Finished difference. Result has 161 places, 232 transitions, 2676 flow [2024-06-14 15:59:10,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2676, PETRI_PLACES=161, PETRI_TRANSITIONS=232} [2024-06-14 15:59:10,550 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 119 predicate places. [2024-06-14 15:59:10,550 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 232 transitions, 2676 flow [2024-06-14 15:59:10,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:10,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:10,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:10,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:59:10,550 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-14 15:59:10,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1265164468, now seen corresponding path program 4 times [2024-06-14 15:59:10,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:10,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587534210] [2024-06-14 15:59:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:10,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:17,813 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-14 15:59:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587534210] [2024-06-14 15:59:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587534210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:17,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953464675] [2024-06-14 15:59:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:17,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:17,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:17,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:18,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:59:18,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 232 transitions, 2676 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:18,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:18,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:59:18,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:19,300 INFO L124 PetriNetUnfolderBase]: 2323/3450 cut-off events. [2024-06-14 15:59:19,301 INFO L125 PetriNetUnfolderBase]: For 119804/119808 co-relation queries the response was YES. [2024-06-14 15:59:19,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24738 conditions, 3450 events. 2323/3450 cut-off events. For 119804/119808 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16234 event pairs, 534 based on Foata normal form. 5/3453 useless extension candidates. Maximal degree in co-relation 24657. Up to 3190 conditions per place. [2024-06-14 15:59:19,337 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 238 selfloop transitions, 48 changer transitions 0/289 dead transitions. [2024-06-14 15:59:19,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 289 transitions, 3565 flow [2024-06-14 15:59:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:59:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:59:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-14 15:59:19,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173441734417344 [2024-06-14 15:59:19,340 INFO L175 Difference]: Start difference. First operand has 161 places, 232 transitions, 2676 flow. Second operand 9 states and 154 transitions. [2024-06-14 15:59:19,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 289 transitions, 3565 flow [2024-06-14 15:59:19,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 289 transitions, 3517 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-14 15:59:19,465 INFO L231 Difference]: Finished difference. Result has 171 places, 251 transitions, 3003 flow [2024-06-14 15:59:19,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2628, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3003, PETRI_PLACES=171, PETRI_TRANSITIONS=251} [2024-06-14 15:59:19,466 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-14 15:59:19,466 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 251 transitions, 3003 flow [2024-06-14 15:59:19,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:19,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:19,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:19,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:59:19,467 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-14 15:59:19,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1444061358, now seen corresponding path program 2 times [2024-06-14 15:59:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:19,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217097486] [2024-06-14 15:59:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:26,467 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-14 15:59:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217097486] [2024-06-14 15:59:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217097486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013057388] [2024-06-14 15:59:26,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:26,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:26,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:26,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:26,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:59:26,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 251 transitions, 3003 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:26,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:26,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:59:26,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:27,765 INFO L124 PetriNetUnfolderBase]: 2340/3477 cut-off events. [2024-06-14 15:59:27,765 INFO L125 PetriNetUnfolderBase]: For 128181/128185 co-relation queries the response was YES. [2024-06-14 15:59:27,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25478 conditions, 3477 events. 2340/3477 cut-off events. For 128181/128185 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16371 event pairs, 573 based on Foata normal form. 8/3483 useless extension candidates. Maximal degree in co-relation 25392. Up to 3409 conditions per place. [2024-06-14 15:59:27,796 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 259 selfloop transitions, 14 changer transitions 0/276 dead transitions. [2024-06-14 15:59:27,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 276 transitions, 3651 flow [2024-06-14 15:59:27,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-14 15:59:27,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 15:59:27,799 INFO L175 Difference]: Start difference. First operand has 171 places, 251 transitions, 3003 flow. Second operand 7 states and 112 transitions. [2024-06-14 15:59:27,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 276 transitions, 3651 flow [2024-06-14 15:59:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 276 transitions, 3611 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-14 15:59:27,951 INFO L231 Difference]: Finished difference. Result has 177 places, 254 transitions, 3049 flow [2024-06-14 15:59:27,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2963, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3049, PETRI_PLACES=177, PETRI_TRANSITIONS=254} [2024-06-14 15:59:27,952 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-14 15:59:27,952 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 254 transitions, 3049 flow [2024-06-14 15:59:27,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:27,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:27,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:27,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:59:27,953 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-14 15:59:27,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1444054414, now seen corresponding path program 5 times [2024-06-14 15:59:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:27,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2270789] [2024-06-14 15:59:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:35,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-14 15:59:35,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:35,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2270789] [2024-06-14 15:59:35,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2270789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:35,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:35,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:35,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903440545] [2024-06-14 15:59:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:35,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:35,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:59:35,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 254 transitions, 3049 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:35,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:35,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:59:35,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:36,729 INFO L124 PetriNetUnfolderBase]: 2372/3523 cut-off events. [2024-06-14 15:59:36,729 INFO L125 PetriNetUnfolderBase]: For 137567/137571 co-relation queries the response was YES. [2024-06-14 15:59:36,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26204 conditions, 3523 events. 2372/3523 cut-off events. For 137567/137571 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16687 event pairs, 565 based on Foata normal form. 10/3531 useless extension candidates. Maximal degree in co-relation 26114. Up to 3394 conditions per place. [2024-06-14 15:59:36,768 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 251 selfloop transitions, 30 changer transitions 0/284 dead transitions. [2024-06-14 15:59:36,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 284 transitions, 3757 flow [2024-06-14 15:59:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:59:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:59:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-14 15:59:36,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-14 15:59:36,788 INFO L175 Difference]: Start difference. First operand has 177 places, 254 transitions, 3049 flow. Second operand 8 states and 133 transitions. [2024-06-14 15:59:36,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 284 transitions, 3757 flow [2024-06-14 15:59:36,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 284 transitions, 3704 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-14 15:59:36,982 INFO L231 Difference]: Finished difference. Result has 182 places, 258 transitions, 3149 flow [2024-06-14 15:59:36,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2996, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3149, PETRI_PLACES=182, PETRI_TRANSITIONS=258} [2024-06-14 15:59:36,983 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2024-06-14 15:59:36,983 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 258 transitions, 3149 flow [2024-06-14 15:59:36,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:36,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:36,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:36,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:59:36,983 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-14 15:59:36,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1215975510, now seen corresponding path program 4 times [2024-06-14 15:59:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:36,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170550369] [2024-06-14 15:59:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:43,770 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-14 15:59:43,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:43,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170550369] [2024-06-14 15:59:43,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170550369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:43,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:43,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:43,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812074482] [2024-06-14 15:59:43,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:43,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:43,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:43,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:43,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:43,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:59:43,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 258 transitions, 3149 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-14 15:59:43,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:43,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:59:43,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:45,161 INFO L124 PetriNetUnfolderBase]: 2289/3418 cut-off events. [2024-06-14 15:59:45,161 INFO L125 PetriNetUnfolderBase]: For 157148/157353 co-relation queries the response was YES. [2024-06-14 15:59:45,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26354 conditions, 3418 events. 2289/3418 cut-off events. For 157148/157353 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16375 event pairs, 423 based on Foata normal form. 27/3385 useless extension candidates. Maximal degree in co-relation 26263. Up to 3125 conditions per place. [2024-06-14 15:59:45,198 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 205 selfloop transitions, 53 changer transitions 0/291 dead transitions. [2024-06-14 15:59:45,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 291 transitions, 3749 flow [2024-06-14 15:59:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:59:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:59:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-14 15:59:45,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-14 15:59:45,201 INFO L175 Difference]: Start difference. First operand has 182 places, 258 transitions, 3149 flow. Second operand 8 states and 145 transitions. [2024-06-14 15:59:45,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 291 transitions, 3749 flow [2024-06-14 15:59:45,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 291 transitions, 3622 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-14 15:59:45,364 INFO L231 Difference]: Finished difference. Result has 184 places, 258 transitions, 3140 flow [2024-06-14 15:59:45,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3022, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3140, PETRI_PLACES=184, PETRI_TRANSITIONS=258} [2024-06-14 15:59:45,365 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places. [2024-06-14 15:59:45,365 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 258 transitions, 3140 flow [2024-06-14 15:59:45,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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-14 15:59:45,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:45,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:45,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:59:45,366 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-14 15:59:45,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1452632238, now seen corresponding path program 3 times [2024-06-14 15:59:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:45,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233910879] [2024-06-14 15:59:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:52,450 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-14 15:59:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:52,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233910879] [2024-06-14 15:59:52,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233910879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:52,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:52,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:52,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555020020] [2024-06-14 15:59:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:52,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:52,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:52,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 15:59:52,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 258 transitions, 3140 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:52,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:52,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 15:59:52,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:53,750 INFO L124 PetriNetUnfolderBase]: 2384/3543 cut-off events. [2024-06-14 15:59:53,750 INFO L125 PetriNetUnfolderBase]: For 148797/148801 co-relation queries the response was YES. [2024-06-14 15:59:53,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26509 conditions, 3543 events. 2384/3543 cut-off events. For 148797/148801 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16736 event pairs, 564 based on Foata normal form. 10/3551 useless extension candidates. Maximal degree in co-relation 26417. Up to 3433 conditions per place. [2024-06-14 15:59:53,791 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 253 selfloop transitions, 26 changer transitions 0/282 dead transitions. [2024-06-14 15:59:53,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 282 transitions, 3812 flow [2024-06-14 15:59:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-14 15:59:53,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40418118466898956 [2024-06-14 15:59:53,793 INFO L175 Difference]: Start difference. First operand has 184 places, 258 transitions, 3140 flow. Second operand 7 states and 116 transitions. [2024-06-14 15:59:53,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 282 transitions, 3812 flow [2024-06-14 15:59:53,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 282 transitions, 3706 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:59:53,970 INFO L231 Difference]: Finished difference. Result has 185 places, 261 transitions, 3162 flow [2024-06-14 15:59:53,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3034, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3162, PETRI_PLACES=185, PETRI_TRANSITIONS=261} [2024-06-14 15:59:53,970 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2024-06-14 15:59:53,971 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 261 transitions, 3162 flow [2024-06-14 15:59:53,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 15:59:53,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:53,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:53,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:59:53,971 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:59:53,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1216160208, now seen corresponding path program 4 times [2024-06-14 15:59:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:53,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768602755] [2024-06-14 15:59:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:01,416 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-14 16:00:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768602755] [2024-06-14 16:00:01,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768602755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:01,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:01,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:00:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759623504] [2024-06-14 16:00:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:01,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:00:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:00:01,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:00:01,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:00:01,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 261 transitions, 3162 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:01,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:01,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:00:01,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:02,916 INFO L124 PetriNetUnfolderBase]: 2399/3568 cut-off events. [2024-06-14 16:00:02,916 INFO L125 PetriNetUnfolderBase]: For 157138/157142 co-relation queries the response was YES. [2024-06-14 16:00:02,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26951 conditions, 3568 events. 2399/3568 cut-off events. For 157138/157142 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16973 event pairs, 531 based on Foata normal form. 12/3578 useless extension candidates. Maximal degree in co-relation 26858. Up to 3367 conditions per place. [2024-06-14 16:00:02,947 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 236 selfloop transitions, 54 changer transitions 0/293 dead transitions. [2024-06-14 16:00:02,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 293 transitions, 3886 flow [2024-06-14 16:00:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:00:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:00:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-14 16:00:02,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-14 16:00:02,948 INFO L175 Difference]: Start difference. First operand has 185 places, 261 transitions, 3162 flow. Second operand 8 states and 138 transitions. [2024-06-14 16:00:02,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 293 transitions, 3886 flow [2024-06-14 16:00:03,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 293 transitions, 3760 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-14 16:00:03,126 INFO L231 Difference]: Finished difference. Result has 189 places, 264 transitions, 3249 flow [2024-06-14 16:00:03,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3036, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3249, PETRI_PLACES=189, PETRI_TRANSITIONS=264} [2024-06-14 16:00:03,126 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places. [2024-06-14 16:00:03,127 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 264 transitions, 3249 flow [2024-06-14 16:00:03,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:03,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:03,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:03,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 16:00:03,127 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-14 16:00:03,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1215980284, now seen corresponding path program 6 times [2024-06-14 16:00:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:03,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931897534] [2024-06-14 16:00:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:10,795 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-14 16:00:10,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:10,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931897534] [2024-06-14 16:00:10,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931897534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:10,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:10,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85593803] [2024-06-14 16:00:10,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:10,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:10,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:10,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:10,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:00:10,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 264 transitions, 3249 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:10,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:10,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:00:10,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:12,302 INFO L124 PetriNetUnfolderBase]: 2431/3614 cut-off events. [2024-06-14 16:00:12,302 INFO L125 PetriNetUnfolderBase]: For 171321/171325 co-relation queries the response was YES. [2024-06-14 16:00:12,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27954 conditions, 3614 events. 2431/3614 cut-off events. For 171321/171325 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17211 event pairs, 558 based on Foata normal form. 10/3622 useless extension candidates. Maximal degree in co-relation 27859. Up to 3346 conditions per place. [2024-06-14 16:00:12,345 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 242 selfloop transitions, 60 changer transitions 0/305 dead transitions. [2024-06-14 16:00:12,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 305 transitions, 4037 flow [2024-06-14 16:00:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-14 16:00:12,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-14 16:00:12,346 INFO L175 Difference]: Start difference. First operand has 189 places, 264 transitions, 3249 flow. Second operand 9 states and 159 transitions. [2024-06-14 16:00:12,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 305 transitions, 4037 flow [2024-06-14 16:00:12,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 305 transitions, 3915 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-14 16:00:12,566 INFO L231 Difference]: Finished difference. Result has 194 places, 268 transitions, 3348 flow [2024-06-14 16:00:12,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3127, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3348, PETRI_PLACES=194, PETRI_TRANSITIONS=268} [2024-06-14 16:00:12,567 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 152 predicate places. [2024-06-14 16:00:12,567 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 268 transitions, 3348 flow [2024-06-14 16:00:12,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:12,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:12,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:12,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 16:00:12,568 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-14 16:00:12,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash 515723604, now seen corresponding path program 7 times [2024-06-14 16:00:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332224858] [2024-06-14 16:00:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:20,484 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-14 16:00:20,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332224858] [2024-06-14 16:00:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332224858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:20,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:20,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:20,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270100764] [2024-06-14 16:00:20,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:20,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:20,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:20,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:20,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:20,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:00:20,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 268 transitions, 3348 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:20,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:20,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:00:20,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:22,231 INFO L124 PetriNetUnfolderBase]: 2479/3682 cut-off events. [2024-06-14 16:00:22,232 INFO L125 PetriNetUnfolderBase]: For 173731/173735 co-relation queries the response was YES. [2024-06-14 16:00:22,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28522 conditions, 3682 events. 2479/3682 cut-off events. For 173731/173735 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17512 event pairs, 556 based on Foata normal form. 10/3690 useless extension candidates. Maximal degree in co-relation 28426. Up to 3289 conditions per place. [2024-06-14 16:00:22,270 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 242 selfloop transitions, 78 changer transitions 0/323 dead transitions. [2024-06-14 16:00:22,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 323 transitions, 4433 flow [2024-06-14 16:00:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:00:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:00:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-14 16:00:22,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-14 16:00:22,272 INFO L175 Difference]: Start difference. First operand has 194 places, 268 transitions, 3348 flow. Second operand 10 states and 182 transitions. [2024-06-14 16:00:22,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 323 transitions, 4433 flow [2024-06-14 16:00:22,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 323 transitions, 4281 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-14 16:00:22,506 INFO L231 Difference]: Finished difference. Result has 199 places, 276 transitions, 3561 flow [2024-06-14 16:00:22,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3196, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3561, PETRI_PLACES=199, PETRI_TRANSITIONS=276} [2024-06-14 16:00:22,507 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-14 16:00:22,507 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 276 transitions, 3561 flow [2024-06-14 16:00:22,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:22,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:22,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:22,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 16:00:22,508 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-14 16:00:22,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1216153264, now seen corresponding path program 8 times [2024-06-14 16:00:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:22,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279105211] [2024-06-14 16:00:22,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:30,539 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-14 16:00:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:30,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279105211] [2024-06-14 16:00:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279105211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:30,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339898427] [2024-06-14 16:00:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:30,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:30,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:00:30,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 276 transitions, 3561 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:30,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:30,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:00:30,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:32,071 INFO L124 PetriNetUnfolderBase]: 2463/3660 cut-off events. [2024-06-14 16:00:32,072 INFO L125 PetriNetUnfolderBase]: For 177473/177477 co-relation queries the response was YES. [2024-06-14 16:00:32,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28448 conditions, 3660 events. 2463/3660 cut-off events. For 177473/177477 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17448 event pairs, 563 based on Foata normal form. 10/3668 useless extension candidates. Maximal degree in co-relation 28350. Up to 3392 conditions per place. [2024-06-14 16:00:32,112 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 252 selfloop transitions, 56 changer transitions 0/311 dead transitions. [2024-06-14 16:00:32,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 311 transitions, 4293 flow [2024-06-14 16:00:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-14 16:00:32,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-14 16:00:32,132 INFO L175 Difference]: Start difference. First operand has 199 places, 276 transitions, 3561 flow. Second operand 9 states and 156 transitions. [2024-06-14 16:00:32,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 311 transitions, 4293 flow [2024-06-14 16:00:32,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 311 transitions, 4047 flow, removed 68 selfloop flow, removed 7 redundant places. [2024-06-14 16:00:32,372 INFO L231 Difference]: Finished difference. Result has 201 places, 277 transitions, 3462 flow [2024-06-14 16:00:32,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3329, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3462, PETRI_PLACES=201, PETRI_TRANSITIONS=277} [2024-06-14 16:00:32,382 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-14 16:00:32,383 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 277 transitions, 3462 flow [2024-06-14 16:00:32,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:32,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:32,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:32,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 16:00:32,384 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-14 16:00:32,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1222646710, now seen corresponding path program 1 times [2024-06-14 16:00:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:32,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584645494] [2024-06-14 16:00:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:39,146 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-14 16:00:39,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:39,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584645494] [2024-06-14 16:00:39,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584645494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:39,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:39,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672283245] [2024-06-14 16:00:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:39,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:39,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:39,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:39,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:00:39,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 277 transitions, 3462 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:39,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:39,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:00:39,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:40,592 INFO L124 PetriNetUnfolderBase]: 2458/3653 cut-off events. [2024-06-14 16:00:40,592 INFO L125 PetriNetUnfolderBase]: For 179079/179083 co-relation queries the response was YES. [2024-06-14 16:00:40,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28167 conditions, 3653 events. 2458/3653 cut-off events. For 179079/179083 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17382 event pairs, 566 based on Foata normal form. 6/3657 useless extension candidates. Maximal degree in co-relation 28068. Up to 3553 conditions per place. [2024-06-14 16:00:40,630 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 278 selfloop transitions, 23 changer transitions 0/304 dead transitions. [2024-06-14 16:00:40,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 304 transitions, 4204 flow [2024-06-14 16:00:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:00:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:00:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-14 16:00:40,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-14 16:00:40,633 INFO L175 Difference]: Start difference. First operand has 201 places, 277 transitions, 3462 flow. Second operand 7 states and 114 transitions. [2024-06-14 16:00:40,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 304 transitions, 4204 flow [2024-06-14 16:00:40,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 304 transitions, 4071 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 16:00:40,826 INFO L231 Difference]: Finished difference. Result has 201 places, 282 transitions, 3473 flow [2024-06-14 16:00:40,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3333, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3473, PETRI_PLACES=201, PETRI_TRANSITIONS=282} [2024-06-14 16:00:40,827 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2024-06-14 16:00:40,827 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 282 transitions, 3473 flow [2024-06-14 16:00:40,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:40,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:40,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:40,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 16:00:40,828 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-14 16:00:40,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1452335568, now seen corresponding path program 5 times [2024-06-14 16:00:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:40,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940009250] [2024-06-14 16:00:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:47,658 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-14 16:00:47,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:47,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940009250] [2024-06-14 16:00:47,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940009250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:47,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:47,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805731243] [2024-06-14 16:00:47,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:47,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:47,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:47,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:47,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:00:47,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 282 transitions, 3473 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:47,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:47,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:00:47,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:48,997 INFO L124 PetriNetUnfolderBase]: 2450/3641 cut-off events. [2024-06-14 16:00:48,998 INFO L125 PetriNetUnfolderBase]: For 185756/185760 co-relation queries the response was YES. [2024-06-14 16:00:49,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28216 conditions, 3641 events. 2450/3641 cut-off events. For 185756/185760 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17264 event pairs, 569 based on Foata normal form. 8/3647 useless extension candidates. Maximal degree in co-relation 28116. Up to 3537 conditions per place. [2024-06-14 16:00:49,039 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 282 selfloop transitions, 21 changer transitions 0/306 dead transitions. [2024-06-14 16:00:49,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 306 transitions, 4179 flow [2024-06-14 16:00:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:00:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:00:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-14 16:00:49,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-14 16:00:49,042 INFO L175 Difference]: Start difference. First operand has 201 places, 282 transitions, 3473 flow. Second operand 7 states and 113 transitions. [2024-06-14 16:00:49,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 306 transitions, 4179 flow [2024-06-14 16:00:49,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 306 transitions, 4106 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-14 16:00:49,278 INFO L231 Difference]: Finished difference. Result has 204 places, 284 transitions, 3494 flow [2024-06-14 16:00:49,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3400, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3494, PETRI_PLACES=204, PETRI_TRANSITIONS=284} [2024-06-14 16:00:49,279 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2024-06-14 16:00:49,279 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 284 transitions, 3494 flow [2024-06-14 16:00:49,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-14 16:00:49,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:49,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:49,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 16:00:49,280 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-14 16:00:49,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:49,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1197765146, now seen corresponding path program 1 times [2024-06-14 16:00:49,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:49,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942772810] [2024-06-14 16:00:49,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:49,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:56,555 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-14 16:00:56,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942772810] [2024-06-14 16:00:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942772810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:56,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:00:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616841535] [2024-06-14 16:00:56,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:56,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:00:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:56,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:00:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:00:56,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:00:56,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 284 transitions, 3494 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:00:56,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:56,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:00:56,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:58,847 INFO L124 PetriNetUnfolderBase]: 3604/5423 cut-off events. [2024-06-14 16:00:58,848 INFO L125 PetriNetUnfolderBase]: For 374650/374654 co-relation queries the response was YES. [2024-06-14 16:00:58,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41968 conditions, 5423 events. 3604/5423 cut-off events. For 374650/374654 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 28136 event pairs, 442 based on Foata normal form. 68/5489 useless extension candidates. Maximal degree in co-relation 41867. Up to 2584 conditions per place. [2024-06-14 16:00:58,895 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 246 selfloop transitions, 176 changer transitions 0/425 dead transitions. [2024-06-14 16:00:58,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 425 transitions, 6050 flow [2024-06-14 16:00:58,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:00:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:00:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 230 transitions. [2024-06-14 16:00:58,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099778270509978 [2024-06-14 16:00:58,896 INFO L175 Difference]: Start difference. First operand has 204 places, 284 transitions, 3494 flow. Second operand 11 states and 230 transitions. [2024-06-14 16:00:58,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 425 transitions, 6050 flow [2024-06-14 16:00:59,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 425 transitions, 5950 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-14 16:00:59,178 INFO L231 Difference]: Finished difference. Result has 216 places, 329 transitions, 4717 flow [2024-06-14 16:00:59,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3420, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4717, PETRI_PLACES=216, PETRI_TRANSITIONS=329} [2024-06-14 16:00:59,178 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2024-06-14 16:00:59,178 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 329 transitions, 4717 flow [2024-06-14 16:00:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:00:59,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:59,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:59,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 16:00:59,179 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-14 16:00:59,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1453934834, now seen corresponding path program 2 times [2024-06-14 16:00:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119914781] [2024-06-14 16:00:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:07,376 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-14 16:01:07,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119914781] [2024-06-14 16:01:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119914781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:07,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:07,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:01:07,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594715521] [2024-06-14 16:01:07,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:07,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:01:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:01:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:01:07,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:01:07,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 329 transitions, 4717 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:07,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:07,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:01:07,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:09,767 INFO L124 PetriNetUnfolderBase]: 3933/5943 cut-off events. [2024-06-14 16:01:09,768 INFO L125 PetriNetUnfolderBase]: For 383729/383733 co-relation queries the response was YES. [2024-06-14 16:01:09,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49852 conditions, 5943 events. 3933/5943 cut-off events. For 383729/383733 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 31815 event pairs, 943 based on Foata normal form. 28/5969 useless extension candidates. Maximal degree in co-relation 49744. Up to 4854 conditions per place. [2024-06-14 16:01:09,832 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 250 selfloop transitions, 151 changer transitions 0/404 dead transitions. [2024-06-14 16:01:09,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 404 transitions, 6204 flow [2024-06-14 16:01:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:01:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:01:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-14 16:01:09,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523281596452328 [2024-06-14 16:01:09,833 INFO L175 Difference]: Start difference. First operand has 216 places, 329 transitions, 4717 flow. Second operand 11 states and 204 transitions. [2024-06-14 16:01:09,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 404 transitions, 6204 flow [2024-06-14 16:01:10,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 404 transitions, 6052 flow, removed 69 selfloop flow, removed 2 redundant places. [2024-06-14 16:01:10,334 INFO L231 Difference]: Finished difference. Result has 226 places, 342 transitions, 5115 flow [2024-06-14 16:01:10,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4593, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5115, PETRI_PLACES=226, PETRI_TRANSITIONS=342} [2024-06-14 16:01:10,335 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places. [2024-06-14 16:01:10,335 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 342 transitions, 5115 flow [2024-06-14 16:01:10,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:10,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:10,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:10,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 16:01:10,336 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-14 16:01:10,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1199642816, now seen corresponding path program 3 times [2024-06-14 16:01:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781070671] [2024-06-14 16:01:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:18,089 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-14 16:01:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781070671] [2024-06-14 16:01:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781070671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:18,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:18,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:01:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159769687] [2024-06-14 16:01:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:18,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:01:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:01:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:01:18,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:01:18,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 342 transitions, 5115 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:18,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:18,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:01:18,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:20,514 INFO L124 PetriNetUnfolderBase]: 3897/5887 cut-off events. [2024-06-14 16:01:20,514 INFO L125 PetriNetUnfolderBase]: For 376549/376553 co-relation queries the response was YES. [2024-06-14 16:01:20,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48888 conditions, 5887 events. 3897/5887 cut-off events. For 376549/376553 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 31471 event pairs, 1039 based on Foata normal form. 21/5906 useless extension candidates. Maximal degree in co-relation 48777. Up to 5235 conditions per place. [2024-06-14 16:01:20,579 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 337 selfloop transitions, 86 changer transitions 0/426 dead transitions. [2024-06-14 16:01:20,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 426 transitions, 6679 flow [2024-06-14 16:01:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:01:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:01:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-14 16:01:20,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2024-06-14 16:01:20,583 INFO L175 Difference]: Start difference. First operand has 226 places, 342 transitions, 5115 flow. Second operand 10 states and 176 transitions. [2024-06-14 16:01:20,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 426 transitions, 6679 flow [2024-06-14 16:01:21,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 426 transitions, 6514 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 16:01:21,171 INFO L231 Difference]: Finished difference. Result has 235 places, 370 transitions, 5747 flow [2024-06-14 16:01:21,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4959, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5747, PETRI_PLACES=235, PETRI_TRANSITIONS=370} [2024-06-14 16:01:21,171 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 193 predicate places. [2024-06-14 16:01:21,171 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 370 transitions, 5747 flow [2024-06-14 16:01:21,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:21,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:21,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:21,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 16:01:21,172 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-14 16:01:21,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:21,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1457513474, now seen corresponding path program 4 times [2024-06-14 16:01:21,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:21,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896698905] [2024-06-14 16:01:21,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:21,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:29,612 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-14 16:01:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896698905] [2024-06-14 16:01:29,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896698905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:29,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:01:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502769406] [2024-06-14 16:01:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:29,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:01:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:01:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:01:29,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:01:29,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 370 transitions, 5747 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:29,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:29,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:01:29,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:32,110 INFO L124 PetriNetUnfolderBase]: 4094/6210 cut-off events. [2024-06-14 16:01:32,110 INFO L125 PetriNetUnfolderBase]: For 430139/430143 co-relation queries the response was YES. [2024-06-14 16:01:32,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51802 conditions, 6210 events. 4094/6210 cut-off events. For 430139/430143 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 33724 event pairs, 1033 based on Foata normal form. 58/6266 useless extension candidates. Maximal degree in co-relation 51685. Up to 5505 conditions per place. [2024-06-14 16:01:32,184 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 314 selfloop transitions, 113 changer transitions 0/430 dead transitions. [2024-06-14 16:01:32,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 430 transitions, 6909 flow [2024-06-14 16:01:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 16:01:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 16:01:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 208 transitions. [2024-06-14 16:01:32,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-14 16:01:32,185 INFO L175 Difference]: Start difference. First operand has 235 places, 370 transitions, 5747 flow. Second operand 12 states and 208 transitions. [2024-06-14 16:01:32,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 430 transitions, 6909 flow [2024-06-14 16:01:32,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 430 transitions, 6813 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 16:01:32,820 INFO L231 Difference]: Finished difference. Result has 244 places, 375 transitions, 6038 flow [2024-06-14 16:01:32,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5651, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6038, PETRI_PLACES=244, PETRI_TRANSITIONS=375} [2024-06-14 16:01:32,821 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places. [2024-06-14 16:01:32,821 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 375 transitions, 6038 flow [2024-06-14 16:01:32,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:32,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:32,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:32,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 16:01:32,822 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-14 16:01:32,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1457509754, now seen corresponding path program 5 times [2024-06-14 16:01:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43312273] [2024-06-14 16:01:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:41,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-14 16:01:41,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:41,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43312273] [2024-06-14 16:01:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43312273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:41,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:41,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:01:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065309499] [2024-06-14 16:01:41,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:41,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:01:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:01:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:01:41,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:01:41,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 375 transitions, 6038 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:41,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:41,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:01:41,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:43,677 INFO L124 PetriNetUnfolderBase]: 4180/6352 cut-off events. [2024-06-14 16:01:43,677 INFO L125 PetriNetUnfolderBase]: For 422280/422284 co-relation queries the response was YES. [2024-06-14 16:01:43,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53371 conditions, 6352 events. 4180/6352 cut-off events. For 422280/422284 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 34765 event pairs, 1019 based on Foata normal form. 28/6378 useless extension candidates. Maximal degree in co-relation 53252. Up to 5499 conditions per place. [2024-06-14 16:01:43,745 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 315 selfloop transitions, 116 changer transitions 0/434 dead transitions. [2024-06-14 16:01:43,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 434 transitions, 7183 flow [2024-06-14 16:01:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:01:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:01:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2024-06-14 16:01:43,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 16:01:43,747 INFO L175 Difference]: Start difference. First operand has 244 places, 375 transitions, 6038 flow. Second operand 11 states and 198 transitions. [2024-06-14 16:01:43,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 434 transitions, 7183 flow [2024-06-14 16:01:44,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 434 transitions, 6844 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-14 16:01:44,401 INFO L231 Difference]: Finished difference. Result has 247 places, 379 transitions, 6054 flow [2024-06-14 16:01:44,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5699, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6054, PETRI_PLACES=247, PETRI_TRANSITIONS=379} [2024-06-14 16:01:44,402 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 205 predicate places. [2024-06-14 16:01:44,402 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 379 transitions, 6054 flow [2024-06-14 16:01:44,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:44,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:44,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:44,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 16:01:44,402 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-14 16:01:44,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 742286740, now seen corresponding path program 1 times [2024-06-14 16:01:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:44,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120822099] [2024-06-14 16:01:44,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:44,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:52,700 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-14 16:01:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120822099] [2024-06-14 16:01:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120822099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:52,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:52,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:01:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283497731] [2024-06-14 16:01:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:52,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:01:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:01:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:01:52,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:01:52,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 379 transitions, 6054 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:52,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:52,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:01:52,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:55,365 INFO L124 PetriNetUnfolderBase]: 4205/6391 cut-off events. [2024-06-14 16:01:55,365 INFO L125 PetriNetUnfolderBase]: For 417178/417182 co-relation queries the response was YES. [2024-06-14 16:01:55,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53715 conditions, 6391 events. 4205/6391 cut-off events. For 417178/417182 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 34968 event pairs, 1150 based on Foata normal form. 10/6399 useless extension candidates. Maximal degree in co-relation 53594. Up to 6143 conditions per place. [2024-06-14 16:01:55,432 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 357 selfloop transitions, 69 changer transitions 0/429 dead transitions. [2024-06-14 16:01:55,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 429 transitions, 7110 flow [2024-06-14 16:01:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 16:01:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 16:01:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-06-14 16:01:55,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40447154471544716 [2024-06-14 16:01:55,439 INFO L175 Difference]: Start difference. First operand has 247 places, 379 transitions, 6054 flow. Second operand 12 states and 199 transitions. [2024-06-14 16:01:55,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 429 transitions, 7110 flow [2024-06-14 16:01:56,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 429 transitions, 6923 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-14 16:01:56,084 INFO L231 Difference]: Finished difference. Result has 252 places, 382 transitions, 6100 flow [2024-06-14 16:01:56,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5867, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6100, PETRI_PLACES=252, PETRI_TRANSITIONS=382} [2024-06-14 16:01:56,085 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2024-06-14 16:01:56,085 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 382 transitions, 6100 flow [2024-06-14 16:01:56,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:01:56,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:56,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:56,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 16:01:56,086 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-14 16:01:56,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 742078978, now seen corresponding path program 6 times [2024-06-14 16:01:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661156750] [2024-06-14 16:01:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:03,887 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-14 16:02:03,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:03,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661156750] [2024-06-14 16:02:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661156750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:03,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:03,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:03,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154225177] [2024-06-14 16:02:03,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:03,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:03,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:03,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:03,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:04,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:02:04,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 382 transitions, 6100 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:02:04,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:04,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:02:04,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:06,611 INFO L124 PetriNetUnfolderBase]: 4316/6572 cut-off events. [2024-06-14 16:02:06,612 INFO L125 PetriNetUnfolderBase]: For 460275/460279 co-relation queries the response was YES. [2024-06-14 16:02:06,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55261 conditions, 6572 events. 4316/6572 cut-off events. For 460275/460279 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 36298 event pairs, 1126 based on Foata normal form. 34/6604 useless extension candidates. Maximal degree in co-relation 55138. Up to 6155 conditions per place. [2024-06-14 16:02:06,689 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 363 selfloop transitions, 74 changer transitions 0/440 dead transitions. [2024-06-14 16:02:06,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 440 transitions, 7208 flow [2024-06-14 16:02:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 16:02:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 16:02:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 218 transitions. [2024-06-14 16:02:06,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090056285178236 [2024-06-14 16:02:06,691 INFO L175 Difference]: Start difference. First operand has 252 places, 382 transitions, 6100 flow. Second operand 13 states and 218 transitions. [2024-06-14 16:02:06,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 440 transitions, 7208 flow [2024-06-14 16:02:07,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 440 transitions, 7016 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-06-14 16:02:07,454 INFO L231 Difference]: Finished difference. Result has 257 places, 384 transitions, 6136 flow [2024-06-14 16:02:07,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5908, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6136, PETRI_PLACES=257, PETRI_TRANSITIONS=384} [2024-06-14 16:02:07,455 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-14 16:02:07,455 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 384 transitions, 6136 flow [2024-06-14 16:02:07,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:02:07,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:07,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:07,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 16:02:07,456 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-14 16:02:07,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash 565389880, now seen corresponding path program 7 times [2024-06-14 16:02:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234845189] [2024-06-14 16:02:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:15,010 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-14 16:02:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:15,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234845189] [2024-06-14 16:02:15,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234845189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:15,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:15,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:15,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524654281] [2024-06-14 16:02:15,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:15,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:15,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:15,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:02:15,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 384 transitions, 6136 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:02:15,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:15,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:02:15,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:17,784 INFO L124 PetriNetUnfolderBase]: 4485/6851 cut-off events. [2024-06-14 16:02:17,784 INFO L125 PetriNetUnfolderBase]: For 485799/485803 co-relation queries the response was YES. [2024-06-14 16:02:17,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57960 conditions, 6851 events. 4485/6851 cut-off events. For 485799/485803 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 38302 event pairs, 1223 based on Foata normal form. 17/6866 useless extension candidates. Maximal degree in co-relation 57836. Up to 6180 conditions per place. [2024-06-14 16:02:17,858 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 384 selfloop transitions, 51 changer transitions 0/438 dead transitions. [2024-06-14 16:02:17,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 438 transitions, 7444 flow [2024-06-14 16:02:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:02:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:02:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-14 16:02:17,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-14 16:02:17,876 INFO L175 Difference]: Start difference. First operand has 257 places, 384 transitions, 6136 flow. Second operand 10 states and 175 transitions. [2024-06-14 16:02:17,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 438 transitions, 7444 flow [2024-06-14 16:02:18,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 438 transitions, 7262 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-06-14 16:02:18,695 INFO L231 Difference]: Finished difference. Result has 257 places, 387 transitions, 6143 flow [2024-06-14 16:02:18,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5956, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6143, PETRI_PLACES=257, PETRI_TRANSITIONS=387} [2024-06-14 16:02:18,696 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-14 16:02:18,696 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 387 transitions, 6143 flow [2024-06-14 16:02:18,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:02:18,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:18,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:18,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 16:02:18,697 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-14 16:02:18,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash 725928998, now seen corresponding path program 2 times [2024-06-14 16:02:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156961985] [2024-06-14 16:02:18,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:18,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:26,517 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-14 16:02:26,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:26,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156961985] [2024-06-14 16:02:26,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156961985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:26,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:26,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:02:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429424203] [2024-06-14 16:02:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:26,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:02:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:26,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:02:26,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:02:26,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:02:26,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 387 transitions, 6143 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-14 16:02:26,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:26,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:02:26,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:29,085 INFO L124 PetriNetUnfolderBase]: 4527/6917 cut-off events. [2024-06-14 16:02:29,086 INFO L125 PetriNetUnfolderBase]: For 494078/494082 co-relation queries the response was YES. [2024-06-14 16:02:29,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58734 conditions, 6917 events. 4527/6917 cut-off events. For 494078/494082 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 38846 event pairs, 1253 based on Foata normal form. 5/6920 useless extension candidates. Maximal degree in co-relation 58608. Up to 6665 conditions per place. [2024-06-14 16:02:29,174 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 395 selfloop transitions, 41 changer transitions 0/439 dead transitions. [2024-06-14 16:02:29,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 439 transitions, 7444 flow [2024-06-14 16:02:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:02:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:02:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 179 transitions. [2024-06-14 16:02:29,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3968957871396896 [2024-06-14 16:02:29,177 INFO L175 Difference]: Start difference. First operand has 257 places, 387 transitions, 6143 flow. Second operand 11 states and 179 transitions. [2024-06-14 16:02:29,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 439 transitions, 7444 flow [2024-06-14 16:02:30,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 439 transitions, 7366 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 16:02:30,045 INFO L231 Difference]: Finished difference. Result has 264 places, 393 transitions, 6286 flow [2024-06-14 16:02:30,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6065, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6286, PETRI_PLACES=264, PETRI_TRANSITIONS=393} [2024-06-14 16:02:30,046 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-14 16:02:30,046 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 393 transitions, 6286 flow [2024-06-14 16:02:30,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-14 16:02:30,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:30,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:30,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 16:02:30,047 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:02:30,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:30,047 INFO L85 PathProgramCache]: Analyzing trace with hash 720207266, now seen corresponding path program 8 times [2024-06-14 16:02:30,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:30,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586396484] [2024-06-14 16:02:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:37,836 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-14 16:02:37,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:37,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586396484] [2024-06-14 16:02:37,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586396484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:37,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:37,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:37,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795476682] [2024-06-14 16:02:37,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:37,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:38,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:02:38,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 393 transitions, 6286 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:02:38,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:38,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:02:38,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:40,729 INFO L124 PetriNetUnfolderBase]: 4602/7042 cut-off events. [2024-06-14 16:02:40,730 INFO L125 PetriNetUnfolderBase]: For 531208/531212 co-relation queries the response was YES. [2024-06-14 16:02:40,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59934 conditions, 7042 events. 4602/7042 cut-off events. For 531208/531212 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 39841 event pairs, 1278 based on Foata normal form. 21/7061 useless extension candidates. Maximal degree in co-relation 59804. Up to 6662 conditions per place. [2024-06-14 16:02:40,808 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 387 selfloop transitions, 49 changer transitions 0/439 dead transitions. [2024-06-14 16:02:40,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 439 transitions, 7332 flow [2024-06-14 16:02:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:02:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:02:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-14 16:02:40,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170731707317073 [2024-06-14 16:02:40,811 INFO L175 Difference]: Start difference. First operand has 264 places, 393 transitions, 6286 flow. Second operand 10 states and 171 transitions. [2024-06-14 16:02:40,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 439 transitions, 7332 flow [2024-06-14 16:02:41,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 439 transitions, 7224 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-14 16:02:41,729 INFO L231 Difference]: Finished difference. Result has 267 places, 394 transitions, 6313 flow [2024-06-14 16:02:41,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6178, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6313, PETRI_PLACES=267, PETRI_TRANSITIONS=394} [2024-06-14 16:02:41,730 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 225 predicate places. [2024-06-14 16:02:41,730 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 394 transitions, 6313 flow [2024-06-14 16:02:41,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:02:41,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:41,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:41,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 16:02:41,730 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-14 16:02:41,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash 565537750, now seen corresponding path program 9 times [2024-06-14 16:02:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:41,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528291958] [2024-06-14 16:02:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:41,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:49,650 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-14 16:02:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528291958] [2024-06-14 16:02:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528291958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001443263] [2024-06-14 16:02:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:49,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:49,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:02:49,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 394 transitions, 6313 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:02:49,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:49,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:02:49,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:52,416 INFO L124 PetriNetUnfolderBase]: 4602/7042 cut-off events. [2024-06-14 16:02:52,416 INFO L125 PetriNetUnfolderBase]: For 540989/540993 co-relation queries the response was YES. [2024-06-14 16:02:52,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59580 conditions, 7042 events. 4602/7042 cut-off events. For 540989/540993 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 39769 event pairs, 1237 based on Foata normal form. 34/7074 useless extension candidates. Maximal degree in co-relation 59448. Up to 6625 conditions per place. [2024-06-14 16:02:52,511 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 368 selfloop transitions, 73 changer transitions 0/444 dead transitions. [2024-06-14 16:02:52,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 444 transitions, 7414 flow [2024-06-14 16:02:52,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:02:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:02:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-14 16:02:52,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212860310421286 [2024-06-14 16:02:52,513 INFO L175 Difference]: Start difference. First operand has 267 places, 394 transitions, 6313 flow. Second operand 11 states and 190 transitions. [2024-06-14 16:02:52,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 444 transitions, 7414 flow [2024-06-14 16:02:53,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 444 transitions, 7287 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 16:02:53,516 INFO L231 Difference]: Finished difference. Result has 270 places, 396 transitions, 6417 flow [2024-06-14 16:02:53,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6196, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6417, PETRI_PLACES=270, PETRI_TRANSITIONS=396} [2024-06-14 16:02:53,516 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places. [2024-06-14 16:02:53,516 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 396 transitions, 6417 flow [2024-06-14 16:02:53,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:02:53,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:53,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:53,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 16:02:53,517 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-14 16:02:53,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash 565543702, now seen corresponding path program 3 times [2024-06-14 16:02:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:53,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450480943] [2024-06-14 16:02:53,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:00,751 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-14 16:03:00,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:00,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450480943] [2024-06-14 16:03:00,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450480943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:00,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:00,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:00,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613261247] [2024-06-14 16:03:00,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:00,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:00,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:03:00,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 396 transitions, 6417 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:00,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:00,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:03:00,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:03,206 INFO L124 PetriNetUnfolderBase]: 4594/7030 cut-off events. [2024-06-14 16:03:03,207 INFO L125 PetriNetUnfolderBase]: For 520194/520198 co-relation queries the response was YES. [2024-06-14 16:03:03,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59549 conditions, 7030 events. 4594/7030 cut-off events. For 520194/520198 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 39767 event pairs, 1236 based on Foata normal form. 5/7033 useless extension candidates. Maximal degree in co-relation 59416. Up to 6843 conditions per place. [2024-06-14 16:03:03,299 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 395 selfloop transitions, 34 changer transitions 0/432 dead transitions. [2024-06-14 16:03:03,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 432 transitions, 7377 flow [2024-06-14 16:03:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:03:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:03:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-14 16:03:03,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-14 16:03:03,302 INFO L175 Difference]: Start difference. First operand has 270 places, 396 transitions, 6417 flow. Second operand 9 states and 151 transitions. [2024-06-14 16:03:03,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 432 transitions, 7377 flow [2024-06-14 16:03:04,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 432 transitions, 7185 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-14 16:03:04,185 INFO L231 Difference]: Finished difference. Result has 270 places, 396 transitions, 6300 flow [2024-06-14 16:03:04,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6225, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6300, PETRI_PLACES=270, PETRI_TRANSITIONS=396} [2024-06-14 16:03:04,186 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places. [2024-06-14 16:03:04,186 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 396 transitions, 6300 flow [2024-06-14 16:03:04,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:04,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:04,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:04,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 16:03:04,187 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-14 16:03:04,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:04,187 INFO L85 PathProgramCache]: Analyzing trace with hash -520278762, now seen corresponding path program 1 times [2024-06-14 16:03:04,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:04,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590990352] [2024-06-14 16:03:04,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:13,113 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-14 16:03:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590990352] [2024-06-14 16:03:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590990352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:13,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:13,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112788152] [2024-06-14 16:03:13,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:13,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:13,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 16:03:13,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 396 transitions, 6300 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:13,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:13,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 16:03:13,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:15,357 INFO L124 PetriNetUnfolderBase]: 4469/6875 cut-off events. [2024-06-14 16:03:15,358 INFO L125 PetriNetUnfolderBase]: For 530454/530497 co-relation queries the response was YES. [2024-06-14 16:03:15,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58481 conditions, 6875 events. 4469/6875 cut-off events. For 530454/530497 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 39103 event pairs, 1225 based on Foata normal form. 16/6852 useless extension candidates. Maximal degree in co-relation 58347. Up to 6653 conditions per place. [2024-06-14 16:03:15,455 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 348 selfloop transitions, 51 changer transitions 0/419 dead transitions. [2024-06-14 16:03:15,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 419 transitions, 7288 flow [2024-06-14 16:03:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-14 16:03:15,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-14 16:03:15,456 INFO L175 Difference]: Start difference. First operand has 270 places, 396 transitions, 6300 flow. Second operand 8 states and 131 transitions. [2024-06-14 16:03:15,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 419 transitions, 7288 flow [2024-06-14 16:03:16,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 419 transitions, 7229 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 16:03:16,447 INFO L231 Difference]: Finished difference. Result has 273 places, 398 transitions, 6388 flow [2024-06-14 16:03:16,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6241, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6388, PETRI_PLACES=273, PETRI_TRANSITIONS=398} [2024-06-14 16:03:16,448 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places. [2024-06-14 16:03:16,448 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 398 transitions, 6388 flow [2024-06-14 16:03:16,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:16,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:16,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:16,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 16:03:16,448 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-14 16:03:16,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1405389560, now seen corresponding path program 4 times [2024-06-14 16:03:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948325348] [2024-06-14 16:03:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:23,237 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-14 16:03:23,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948325348] [2024-06-14 16:03:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948325348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:23,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:23,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666159943] [2024-06-14 16:03:23,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:23,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:23,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:23,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:03:23,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 398 transitions, 6388 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:23,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:23,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:03:23,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:25,738 INFO L124 PetriNetUnfolderBase]: 4593/7033 cut-off events. [2024-06-14 16:03:25,739 INFO L125 PetriNetUnfolderBase]: For 540396/540400 co-relation queries the response was YES. [2024-06-14 16:03:25,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59507 conditions, 7033 events. 4593/7033 cut-off events. For 540396/540400 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 39847 event pairs, 1311 based on Foata normal form. 5/7036 useless extension candidates. Maximal degree in co-relation 59372. Up to 6835 conditions per place. [2024-06-14 16:03:25,841 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 399 selfloop transitions, 34 changer transitions 0/436 dead transitions. [2024-06-14 16:03:25,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 436 transitions, 7434 flow [2024-06-14 16:03:25,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 16:03:25,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-14 16:03:25,844 INFO L175 Difference]: Start difference. First operand has 273 places, 398 transitions, 6388 flow. Second operand 8 states and 139 transitions. [2024-06-14 16:03:25,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 436 transitions, 7434 flow [2024-06-14 16:03:27,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 436 transitions, 7269 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-14 16:03:27,035 INFO L231 Difference]: Finished difference. Result has 276 places, 402 transitions, 6405 flow [2024-06-14 16:03:27,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6225, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6405, PETRI_PLACES=276, PETRI_TRANSITIONS=402} [2024-06-14 16:03:27,035 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 234 predicate places. [2024-06-14 16:03:27,036 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 402 transitions, 6405 flow [2024-06-14 16:03:27,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:27,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:27,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:27,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 16:03:27,036 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:03:27,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash -959316104, now seen corresponding path program 10 times [2024-06-14 16:03:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529891172] [2024-06-14 16:03:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:34,722 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-14 16:03:34,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529891172] [2024-06-14 16:03:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529891172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:34,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261694463] [2024-06-14 16:03:34,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:34,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:34,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:34,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:34,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:34,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:03:34,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 402 transitions, 6405 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:34,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:34,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:03:34,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:37,568 INFO L124 PetriNetUnfolderBase]: 4704/7214 cut-off events. [2024-06-14 16:03:37,569 INFO L125 PetriNetUnfolderBase]: For 603257/603261 co-relation queries the response was YES. [2024-06-14 16:03:37,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61124 conditions, 7214 events. 4704/7214 cut-off events. For 603257/603261 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 41220 event pairs, 1317 based on Foata normal form. 34/7246 useless extension candidates. Maximal degree in co-relation 60989. Up to 6784 conditions per place. [2024-06-14 16:03:37,687 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 373 selfloop transitions, 74 changer transitions 0/450 dead transitions. [2024-06-14 16:03:37,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 450 transitions, 7515 flow [2024-06-14 16:03:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:03:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:03:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-14 16:03:37,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317073170731707 [2024-06-14 16:03:37,688 INFO L175 Difference]: Start difference. First operand has 276 places, 402 transitions, 6405 flow. Second operand 10 states and 177 transitions. [2024-06-14 16:03:37,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 450 transitions, 7515 flow [2024-06-14 16:03:38,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 450 transitions, 7423 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-14 16:03:38,959 INFO L231 Difference]: Finished difference. Result has 282 places, 404 transitions, 6549 flow [2024-06-14 16:03:38,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6313, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6549, PETRI_PLACES=282, PETRI_TRANSITIONS=404} [2024-06-14 16:03:38,960 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 240 predicate places. [2024-06-14 16:03:38,960 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 404 transitions, 6549 flow [2024-06-14 16:03:38,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:38,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:38,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:38,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 16:03:38,961 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-14 16:03:38,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1192440424, now seen corresponding path program 11 times [2024-06-14 16:03:38,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:38,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367175922] [2024-06-14 16:03:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:38,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:46,872 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-14 16:03:46,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367175922] [2024-06-14 16:03:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367175922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:46,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:46,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553303560] [2024-06-14 16:03:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:46,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:47,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:03:47,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 404 transitions, 6549 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:47,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:47,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:03:47,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:49,797 INFO L124 PetriNetUnfolderBase]: 4935/7587 cut-off events. [2024-06-14 16:03:49,797 INFO L125 PetriNetUnfolderBase]: For 665435/665439 co-relation queries the response was YES. [2024-06-14 16:03:49,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65772 conditions, 7587 events. 4935/7587 cut-off events. For 665435/665439 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 43917 event pairs, 1226 based on Foata normal form. 28/7613 useless extension candidates. Maximal degree in co-relation 65636. Up to 6584 conditions per place. [2024-06-14 16:03:49,896 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 353 selfloop transitions, 107 changer transitions 0/463 dead transitions. [2024-06-14 16:03:49,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 463 transitions, 8021 flow [2024-06-14 16:03:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:03:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:03:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-14 16:03:49,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560975609756098 [2024-06-14 16:03:49,898 INFO L175 Difference]: Start difference. First operand has 282 places, 404 transitions, 6549 flow. Second operand 10 states and 187 transitions. [2024-06-14 16:03:49,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 463 transitions, 8021 flow [2024-06-14 16:03:51,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 463 transitions, 7833 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-14 16:03:51,134 INFO L231 Difference]: Finished difference. Result has 285 places, 409 transitions, 6778 flow [2024-06-14 16:03:51,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6361, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6778, PETRI_PLACES=285, PETRI_TRANSITIONS=409} [2024-06-14 16:03:51,135 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places. [2024-06-14 16:03:51,135 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 409 transitions, 6778 flow [2024-06-14 16:03:51,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:51,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:51,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:51,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 16:03:51,136 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-14 16:03:51,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash 646263190, now seen corresponding path program 5 times [2024-06-14 16:03:51,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:51,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095127888] [2024-06-14 16:03:51,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:51,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:58,500 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-14 16:03:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095127888] [2024-06-14 16:03:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095127888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:58,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:58,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:03:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066993889] [2024-06-14 16:03:58,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:58,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:03:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:58,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:03:58,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:03:58,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:03:58,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 409 transitions, 6778 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:03:58,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:58,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:03:58,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:01,224 INFO L124 PetriNetUnfolderBase]: 4952/7614 cut-off events. [2024-06-14 16:04:01,225 INFO L125 PetriNetUnfolderBase]: For 657179/657183 co-relation queries the response was YES. [2024-06-14 16:04:01,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66389 conditions, 7614 events. 4952/7614 cut-off events. For 657179/657183 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 44213 event pairs, 1408 based on Foata normal form. 5/7617 useless extension candidates. Maximal degree in co-relation 66251. Up to 7416 conditions per place. [2024-06-14 16:04:01,319 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 407 selfloop transitions, 32 changer transitions 0/442 dead transitions. [2024-06-14 16:04:01,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 442 transitions, 7798 flow [2024-06-14 16:04:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:01,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 16:04:01,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 16:04:01,322 INFO L175 Difference]: Start difference. First operand has 285 places, 409 transitions, 6778 flow. Second operand 8 states and 136 transitions. [2024-06-14 16:04:01,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 442 transitions, 7798 flow [2024-06-14 16:04:02,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 442 transitions, 7610 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-14 16:04:02,446 INFO L231 Difference]: Finished difference. Result has 287 places, 411 transitions, 6719 flow [2024-06-14 16:04:02,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6590, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6719, PETRI_PLACES=287, PETRI_TRANSITIONS=411} [2024-06-14 16:04:02,447 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places. [2024-06-14 16:04:02,447 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 411 transitions, 6719 flow [2024-06-14 16:04:02,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:02,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:02,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:02,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 16:04:02,447 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-14 16:04:02,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1816020582, now seen corresponding path program 6 times [2024-06-14 16:04:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264516615] [2024-06-14 16:04:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:08,947 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-14 16:04:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:08,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264516615] [2024-06-14 16:04:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264516615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:08,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:08,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:04:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001127136] [2024-06-14 16:04:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:08,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:04:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:04:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:04:09,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:04:09,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 411 transitions, 6719 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:09,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:09,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:04:09,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:11,741 INFO L124 PetriNetUnfolderBase]: 4969/7641 cut-off events. [2024-06-14 16:04:11,741 INFO L125 PetriNetUnfolderBase]: For 669679/669683 co-relation queries the response was YES. [2024-06-14 16:04:11,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66549 conditions, 7641 events. 4969/7641 cut-off events. For 669679/669683 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 44404 event pairs, 1431 based on Foata normal form. 8/7647 useless extension candidates. Maximal degree in co-relation 66409. Up to 7550 conditions per place. [2024-06-14 16:04:11,843 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 420 selfloop transitions, 17 changer transitions 0/440 dead transitions. [2024-06-14 16:04:11,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 440 transitions, 7727 flow [2024-06-14 16:04:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-14 16:04:11,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-14 16:04:11,846 INFO L175 Difference]: Start difference. First operand has 287 places, 411 transitions, 6719 flow. Second operand 8 states and 127 transitions. [2024-06-14 16:04:11,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 440 transitions, 7727 flow [2024-06-14 16:04:12,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 440 transitions, 7644 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-14 16:04:12,954 INFO L231 Difference]: Finished difference. Result has 292 places, 413 transitions, 6739 flow [2024-06-14 16:04:12,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6636, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6739, PETRI_PLACES=292, PETRI_TRANSITIONS=413} [2024-06-14 16:04:12,955 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 250 predicate places. [2024-06-14 16:04:12,955 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 413 transitions, 6739 flow [2024-06-14 16:04:12,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:12,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:12,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:12,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 16:04:12,956 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-14 16:04:12,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2072730342, now seen corresponding path program 7 times [2024-06-14 16:04:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273036824] [2024-06-14 16:04:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:19,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273036824] [2024-06-14 16:04:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273036824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:19,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:19,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:04:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346692938] [2024-06-14 16:04:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:19,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:04:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:04:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:04:19,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:04:19,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 413 transitions, 6739 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:19,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:19,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:04:19,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:22,510 INFO L124 PetriNetUnfolderBase]: 5011/7707 cut-off events. [2024-06-14 16:04:22,510 INFO L125 PetriNetUnfolderBase]: For 700178/700182 co-relation queries the response was YES. [2024-06-14 16:04:22,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67678 conditions, 7707 events. 5011/7707 cut-off events. For 700178/700182 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 44881 event pairs, 1438 based on Foata normal form. 8/7713 useless extension candidates. Maximal degree in co-relation 67537. Up to 7496 conditions per place. [2024-06-14 16:04:22,612 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 412 selfloop transitions, 31 changer transitions 0/446 dead transitions. [2024-06-14 16:04:22,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 446 transitions, 8059 flow [2024-06-14 16:04:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-14 16:04:22,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-14 16:04:22,615 INFO L175 Difference]: Start difference. First operand has 292 places, 413 transitions, 6739 flow. Second operand 8 states and 131 transitions. [2024-06-14 16:04:22,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 446 transitions, 8059 flow [2024-06-14 16:04:23,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 446 transitions, 7982 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-14 16:04:23,736 INFO L231 Difference]: Finished difference. Result has 296 places, 417 transitions, 6860 flow [2024-06-14 16:04:23,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6662, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6860, PETRI_PLACES=296, PETRI_TRANSITIONS=417} [2024-06-14 16:04:23,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 254 predicate places. [2024-06-14 16:04:23,736 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 417 transitions, 6860 flow [2024-06-14 16:04:23,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:23,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:23,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:23,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 16:04:23,737 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-14 16:04:23,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1816014630, now seen corresponding path program 12 times [2024-06-14 16:04:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218511992] [2024-06-14 16:04:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:31,746 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-14 16:04:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218511992] [2024-06-14 16:04:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218511992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:04:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106778472] [2024-06-14 16:04:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:31,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:04:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:04:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:04:31,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:04:31,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 417 transitions, 6860 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:31,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:31,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:04:31,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:34,929 INFO L124 PetriNetUnfolderBase]: 5122/7888 cut-off events. [2024-06-14 16:04:34,930 INFO L125 PetriNetUnfolderBase]: For 772957/772961 co-relation queries the response was YES. [2024-06-14 16:04:34,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69381 conditions, 7888 events. 5122/7888 cut-off events. For 772957/772961 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 46214 event pairs, 1452 based on Foata normal form. 34/7920 useless extension candidates. Maximal degree in co-relation 69239. Up to 7597 conditions per place. [2024-06-14 16:04:35,027 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 415 selfloop transitions, 36 changer transitions 0/454 dead transitions. [2024-06-14 16:04:35,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 454 transitions, 7948 flow [2024-06-14 16:04:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:04:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:04:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-14 16:04:35,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-14 16:04:35,029 INFO L175 Difference]: Start difference. First operand has 296 places, 417 transitions, 6860 flow. Second operand 9 states and 151 transitions. [2024-06-14 16:04:35,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 454 transitions, 7948 flow [2024-06-14 16:04:36,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 454 transitions, 7843 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-14 16:04:36,404 INFO L231 Difference]: Finished difference. Result has 301 places, 419 transitions, 6915 flow [2024-06-14 16:04:36,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6755, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6915, PETRI_PLACES=301, PETRI_TRANSITIONS=419} [2024-06-14 16:04:36,405 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-14 16:04:36,405 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 419 transitions, 6915 flow [2024-06-14 16:04:36,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:36,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:36,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:36,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 16:04:36,406 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-14 16:04:36,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2081927112, now seen corresponding path program 8 times [2024-06-14 16:04:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:36,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223483289] [2024-06-14 16:04:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:44,307 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-14 16:04:44,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:44,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223483289] [2024-06-14 16:04:44,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223483289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:44,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:44,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:04:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338618450] [2024-06-14 16:04:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:44,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:04:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:44,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:04:44,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:04:44,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:04:44,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 419 transitions, 6915 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:44,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:44,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:04:44,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:47,177 INFO L124 PetriNetUnfolderBase]: 5147/7927 cut-off events. [2024-06-14 16:04:47,177 INFO L125 PetriNetUnfolderBase]: For 753198/753202 co-relation queries the response was YES. [2024-06-14 16:04:47,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70117 conditions, 7927 events. 5147/7927 cut-off events. For 753198/753202 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 46412 event pairs, 1466 based on Foata normal form. 10/7935 useless extension candidates. Maximal degree in co-relation 69973. Up to 7786 conditions per place. [2024-06-14 16:04:47,289 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 416 selfloop transitions, 29 changer transitions 0/448 dead transitions. [2024-06-14 16:04:47,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 448 transitions, 7975 flow [2024-06-14 16:04:47,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-14 16:04:47,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-14 16:04:47,291 INFO L175 Difference]: Start difference. First operand has 301 places, 419 transitions, 6915 flow. Second operand 8 states and 131 transitions. [2024-06-14 16:04:47,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 448 transitions, 7975 flow [2024-06-14 16:04:48,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 448 transitions, 7869 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-14 16:04:48,700 INFO L231 Difference]: Finished difference. Result has 302 places, 422 transitions, 6987 flow [2024-06-14 16:04:48,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6809, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6987, PETRI_PLACES=302, PETRI_TRANSITIONS=422} [2024-06-14 16:04:48,701 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 260 predicate places. [2024-06-14 16:04:48,701 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 422 transitions, 6987 flow [2024-06-14 16:04:48,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:48,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:48,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:48,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 16:04:48,702 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-14 16:04:48,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -959460254, now seen corresponding path program 13 times [2024-06-14 16:04:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:48,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851842493] [2024-06-14 16:04:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:56,701 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-14 16:04:56,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:56,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851842493] [2024-06-14 16:04:56,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851842493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:56,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:56,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:04:56,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767648659] [2024-06-14 16:04:56,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:56,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:04:56,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:56,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:04:56,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:04:56,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:04:56,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 422 transitions, 6987 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:04:56,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:56,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:04:56,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:59,826 INFO L124 PetriNetUnfolderBase]: 5222/8052 cut-off events. [2024-06-14 16:04:59,826 INFO L125 PetriNetUnfolderBase]: For 799485/799489 co-relation queries the response was YES. [2024-06-14 16:04:59,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70971 conditions, 8052 events. 5222/8052 cut-off events. For 799485/799489 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 47540 event pairs, 1453 based on Foata normal form. 21/8071 useless extension candidates. Maximal degree in co-relation 70826. Up to 7603 conditions per place. [2024-06-14 16:04:59,932 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 411 selfloop transitions, 60 changer transitions 0/474 dead transitions. [2024-06-14 16:04:59,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 474 transitions, 8395 flow [2024-06-14 16:04:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:04:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:04:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-14 16:04:59,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-14 16:04:59,935 INFO L175 Difference]: Start difference. First operand has 302 places, 422 transitions, 6987 flow. Second operand 9 states and 165 transitions. [2024-06-14 16:04:59,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 474 transitions, 8395 flow [2024-06-14 16:05:01,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 474 transitions, 8241 flow, removed 50 selfloop flow, removed 6 redundant places. [2024-06-14 16:05:01,252 INFO L231 Difference]: Finished difference. Result has 306 places, 426 transitions, 7061 flow [2024-06-14 16:05:01,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6833, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7061, PETRI_PLACES=306, PETRI_TRANSITIONS=426} [2024-06-14 16:05:01,253 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places. [2024-06-14 16:05:01,253 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 426 transitions, 7061 flow [2024-06-14 16:05:01,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:05:01,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:01,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 16:05:01,254 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-14 16:05:01,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash 646270630, now seen corresponding path program 9 times [2024-06-14 16:05:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:01,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152297856] [2024-06-14 16:05:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:09,069 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-14 16:05:09,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152297856] [2024-06-14 16:05:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152297856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:09,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:09,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:05:09,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103219352] [2024-06-14 16:05:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:09,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:05:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:09,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:05:09,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:05:09,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:05:09,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 426 transitions, 7061 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-14 16:05:09,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:09,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:05:09,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:12,240 INFO L124 PetriNetUnfolderBase]: 5214/8040 cut-off events. [2024-06-14 16:05:12,241 INFO L125 PetriNetUnfolderBase]: For 785794/785798 co-relation queries the response was YES. [2024-06-14 16:05:12,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71056 conditions, 8040 events. 5214/8040 cut-off events. For 785794/785798 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 47574 event pairs, 1485 based on Foata normal form. 5/8043 useless extension candidates. Maximal degree in co-relation 70909. Up to 7783 conditions per place. [2024-06-14 16:05:12,339 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 420 selfloop transitions, 37 changer transitions 0/460 dead transitions. [2024-06-14 16:05:12,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 460 transitions, 8137 flow [2024-06-14 16:05:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:05:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:05:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 16:05:12,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 16:05:12,342 INFO L175 Difference]: Start difference. First operand has 306 places, 426 transitions, 7061 flow. Second operand 8 states and 136 transitions. [2024-06-14 16:05:12,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 460 transitions, 8137 flow [2024-06-14 16:05:13,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 460 transitions, 8025 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-14 16:05:13,624 INFO L231 Difference]: Finished difference. Result has 310 places, 429 transitions, 7121 flow [2024-06-14 16:05:13,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6949, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7121, PETRI_PLACES=310, PETRI_TRANSITIONS=429} [2024-06-14 16:05:13,625 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 268 predicate places. [2024-06-14 16:05:13,625 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 429 transitions, 7121 flow [2024-06-14 16:05:13,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-14 16:05:13,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:13,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:13,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 16:05:13,625 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-14 16:05:13,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2072722685, now seen corresponding path program 1 times [2024-06-14 16:05:13,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:13,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192710282] [2024-06-14 16:05:13,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:13,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:20,397 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-14 16:05:20,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:20,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192710282] [2024-06-14 16:05:20,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192710282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:20,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:20,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:05:20,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028738304] [2024-06-14 16:05:20,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:20,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:05:20,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:20,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:05:20,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:05:20,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:05:20,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 429 transitions, 7121 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:05:20,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:20,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:05:20,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:23,538 INFO L124 PetriNetUnfolderBase]: 5209/8033 cut-off events. [2024-06-14 16:05:23,539 INFO L125 PetriNetUnfolderBase]: For 798560/798564 co-relation queries the response was YES. [2024-06-14 16:05:23,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71154 conditions, 8033 events. 5209/8033 cut-off events. For 798560/798564 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 47507 event pairs, 1482 based on Foata normal form. 6/8037 useless extension candidates. Maximal degree in co-relation 71005. Up to 7901 conditions per place. [2024-06-14 16:05:23,637 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 424 selfloop transitions, 29 changer transitions 0/456 dead transitions. [2024-06-14 16:05:23,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 456 transitions, 8105 flow [2024-06-14 16:05:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:05:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:05:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-14 16:05:23,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-14 16:05:23,640 INFO L175 Difference]: Start difference. First operand has 310 places, 429 transitions, 7121 flow. Second operand 8 states and 129 transitions. [2024-06-14 16:05:23,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 456 transitions, 8105 flow [2024-06-14 16:05:25,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 456 transitions, 7951 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-14 16:05:25,092 INFO L231 Difference]: Finished difference. Result has 313 places, 429 transitions, 7037 flow [2024-06-14 16:05:25,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6967, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7037, PETRI_PLACES=313, PETRI_TRANSITIONS=429} [2024-06-14 16:05:25,093 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 271 predicate places. [2024-06-14 16:05:25,093 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 429 transitions, 7037 flow [2024-06-14 16:05:25,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:05:25,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:25,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:25,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 16:05:25,094 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:05:25,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash -953953724, now seen corresponding path program 14 times [2024-06-14 16:05:25,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:25,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062341772] [2024-06-14 16:05:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:32,637 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-14 16:05:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:32,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062341772] [2024-06-14 16:05:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062341772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:32,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:32,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:05:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031885384] [2024-06-14 16:05:32,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:32,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:05:32,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:32,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:05:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:05:32,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:05:32,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 429 transitions, 7037 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:05:32,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:32,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:05:32,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:35,751 INFO L124 PetriNetUnfolderBase]: 5209/8033 cut-off events. [2024-06-14 16:05:35,752 INFO L125 PetriNetUnfolderBase]: For 842516/842520 co-relation queries the response was YES. [2024-06-14 16:05:35,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70242 conditions, 8033 events. 5209/8033 cut-off events. For 842516/842520 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 47492 event pairs, 1445 based on Foata normal form. 34/8065 useless extension candidates. Maximal degree in co-relation 70092. Up to 7603 conditions per place. [2024-06-14 16:05:35,866 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 401 selfloop transitions, 70 changer transitions 0/474 dead transitions. [2024-06-14 16:05:35,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 474 transitions, 8193 flow [2024-06-14 16:05:35,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:05:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:05:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-14 16:05:35,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424390243902439 [2024-06-14 16:05:35,868 INFO L175 Difference]: Start difference. First operand has 313 places, 429 transitions, 7037 flow. Second operand 10 states and 174 transitions. [2024-06-14 16:05:35,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 474 transitions, 8193 flow [2024-06-14 16:05:37,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 474 transitions, 8139 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 16:05:37,392 INFO L231 Difference]: Finished difference. Result has 317 places, 431 transitions, 7217 flow [2024-06-14 16:05:37,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6983, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7217, PETRI_PLACES=317, PETRI_TRANSITIONS=431} [2024-06-14 16:05:37,393 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-14 16:05:37,393 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 431 transitions, 7217 flow [2024-06-14 16:05:37,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:05:37,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:37,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:37,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 16:05:37,394 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:05:37,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1823372232, now seen corresponding path program 10 times [2024-06-14 16:05:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:37,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114788006] [2024-06-14 16:05:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:44,196 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-14 16:05:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114788006] [2024-06-14 16:05:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114788006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:05:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768221128] [2024-06-14 16:05:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:44,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:05:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:44,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:05:44,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:05:44,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:05:44,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 431 transitions, 7217 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:05:44,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:44,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:05:44,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:47,213 INFO L124 PetriNetUnfolderBase]: 5201/8021 cut-off events. [2024-06-14 16:05:47,213 INFO L125 PetriNetUnfolderBase]: For 802198/802202 co-relation queries the response was YES. [2024-06-14 16:05:47,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70493 conditions, 8021 events. 5201/8021 cut-off events. For 802198/802202 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 47337 event pairs, 1475 based on Foata normal form. 8/8027 useless extension candidates. Maximal degree in co-relation 70342. Up to 7885 conditions per place. [2024-06-14 16:05:47,343 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 428 selfloop transitions, 27 changer transitions 0/458 dead transitions. [2024-06-14 16:05:47,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 458 transitions, 8203 flow [2024-06-14 16:05:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:05:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:05:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-14 16:05:47,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 16:05:47,346 INFO L175 Difference]: Start difference. First operand has 317 places, 431 transitions, 7217 flow. Second operand 8 states and 128 transitions. [2024-06-14 16:05:47,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 458 transitions, 8203 flow [2024-06-14 16:05:49,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 458 transitions, 7993 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-14 16:05:49,085 INFO L231 Difference]: Finished difference. Result has 317 places, 431 transitions, 7071 flow [2024-06-14 16:05:49,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7007, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7071, PETRI_PLACES=317, PETRI_TRANSITIONS=431} [2024-06-14 16:05:49,085 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-14 16:05:49,086 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 431 transitions, 7071 flow [2024-06-14 16:05:49,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 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-14 16:05:49,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:49,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:49,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 16:05:49,086 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-14 16:05:49,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:49,087 INFO L85 PathProgramCache]: Analyzing trace with hash -364753992, now seen corresponding path program 2 times [2024-06-14 16:05:49,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:49,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560158131] [2024-06-14 16:05:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:58,213 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-14 16:05:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560158131] [2024-06-14 16:05:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560158131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:58,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:58,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052511093] [2024-06-14 16:05:58,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:58,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:58,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:58,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:58,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 16:05:58,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 431 transitions, 7071 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:58,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:58,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 16:05:58,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:01,071 INFO L124 PetriNetUnfolderBase]: 5122/7930 cut-off events. [2024-06-14 16:06:01,071 INFO L125 PetriNetUnfolderBase]: For 823873/823915 co-relation queries the response was YES. [2024-06-14 16:06:01,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69924 conditions, 7930 events. 5122/7930 cut-off events. For 823873/823915 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 47093 event pairs, 1313 based on Foata normal form. 10/7898 useless extension candidates. Maximal degree in co-relation 69772. Up to 7694 conditions per place. [2024-06-14 16:06:01,181 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 378 selfloop transitions, 60 changer transitions 0/459 dead transitions. [2024-06-14 16:06:01,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 459 transitions, 8246 flow [2024-06-14 16:06:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-14 16:06:01,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 16:06:01,182 INFO L175 Difference]: Start difference. First operand has 317 places, 431 transitions, 7071 flow. Second operand 7 states and 119 transitions. [2024-06-14 16:06:01,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 459 transitions, 8246 flow [2024-06-14 16:06:03,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 459 transitions, 8184 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 16:06:03,012 INFO L231 Difference]: Finished difference. Result has 317 places, 439 transitions, 7268 flow [2024-06-14 16:06:03,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7009, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7268, PETRI_PLACES=317, PETRI_TRANSITIONS=439} [2024-06-14 16:06:03,013 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-14 16:06:03,013 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 439 transitions, 7268 flow [2024-06-14 16:06:03,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:03,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:03,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:03,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 16:06:03,014 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:06:03,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1282191948, now seen corresponding path program 3 times [2024-06-14 16:06:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951148413] [2024-06-14 16:06:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:12,261 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-14 16:06:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951148413] [2024-06-14 16:06:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951148413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:12,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340925478] [2024-06-14 16:06:12,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:12,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:12,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 16:06:12,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 439 transitions, 7268 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:12,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:12,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 16:06:12,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:14,942 INFO L124 PetriNetUnfolderBase]: 5127/7937 cut-off events. [2024-06-14 16:06:14,943 INFO L125 PetriNetUnfolderBase]: For 840904/840938 co-relation queries the response was YES. [2024-06-14 16:06:15,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70289 conditions, 7937 events. 5127/7937 cut-off events. For 840904/840938 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 47078 event pairs, 1418 based on Foata normal form. 10/7903 useless extension candidates. Maximal degree in co-relation 70136. Up to 7784 conditions per place. [2024-06-14 16:06:15,057 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 414 selfloop transitions, 27 changer transitions 0/462 dead transitions. [2024-06-14 16:06:15,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 462 transitions, 8344 flow [2024-06-14 16:06:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:06:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:06:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-14 16:06:15,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37630662020905925 [2024-06-14 16:06:15,059 INFO L175 Difference]: Start difference. First operand has 317 places, 439 transitions, 7268 flow. Second operand 7 states and 108 transitions. [2024-06-14 16:06:15,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 462 transitions, 8344 flow [2024-06-14 16:06:17,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 462 transitions, 8214 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-14 16:06:17,077 INFO L231 Difference]: Finished difference. Result has 320 places, 451 transitions, 7396 flow [2024-06-14 16:06:17,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7150, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7396, PETRI_PLACES=320, PETRI_TRANSITIONS=451} [2024-06-14 16:06:17,078 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 278 predicate places. [2024-06-14 16:06:17,078 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 451 transitions, 7396 flow [2024-06-14 16:06:17,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:17,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:17,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:17,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 16:06:17,078 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:06:17,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -541821156, now seen corresponding path program 1 times [2024-06-14 16:06:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318379187] [2024-06-14 16:06:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:29,065 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-14 16:06:29,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318379187] [2024-06-14 16:06:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318379187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:29,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:29,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317163577] [2024-06-14 16:06:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:29,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:29,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:29,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:29,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:29,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:06:29,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 451 transitions, 7396 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-14 16:06:29,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:29,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:06:29,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:31,983 INFO L124 PetriNetUnfolderBase]: 5231/8064 cut-off events. [2024-06-14 16:06:31,983 INFO L125 PetriNetUnfolderBase]: For 823812/823816 co-relation queries the response was YES. [2024-06-14 16:06:32,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70604 conditions, 8064 events. 5231/8064 cut-off events. For 823812/823816 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 47638 event pairs, 1416 based on Foata normal form. 6/8068 useless extension candidates. Maximal degree in co-relation 70450. Up to 8001 conditions per place. [2024-06-14 16:06:32,086 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 441 selfloop transitions, 23 changer transitions 0/467 dead transitions. [2024-06-14 16:06:32,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 467 transitions, 8430 flow [2024-06-14 16:06:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:06:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:06:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-14 16:06:32,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-06-14 16:06:32,088 INFO L175 Difference]: Start difference. First operand has 320 places, 451 transitions, 7396 flow. Second operand 6 states and 97 transitions. [2024-06-14 16:06:32,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 467 transitions, 8430 flow [2024-06-14 16:06:33,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 467 transitions, 8346 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-14 16:06:33,760 INFO L231 Difference]: Finished difference. Result has 322 places, 454 transitions, 7443 flow [2024-06-14 16:06:33,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7312, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7443, PETRI_PLACES=322, PETRI_TRANSITIONS=454} [2024-06-14 16:06:33,762 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 280 predicate places. [2024-06-14 16:06:33,762 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 454 transitions, 7443 flow [2024-06-14 16:06:33,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-14 16:06:33,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:33,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:33,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 16:06:33,763 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:06:33,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1282177068, now seen corresponding path program 1 times [2024-06-14 16:06:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:33,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448126829] [2024-06-14 16:06:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:45,838 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-14 16:06:45,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448126829] [2024-06-14 16:06:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448126829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:45,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:45,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600397678] [2024-06-14 16:06:45,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:45,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:45,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:46,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 16:06:46,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 454 transitions, 7443 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:46,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:46,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 16:06:46,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:48,580 INFO L124 PetriNetUnfolderBase]: 5114/7918 cut-off events. [2024-06-14 16:06:48,581 INFO L125 PetriNetUnfolderBase]: For 851652/851692 co-relation queries the response was YES. [2024-06-14 16:06:48,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70309 conditions, 7918 events. 5114/7918 cut-off events. For 851652/851692 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 46886 event pairs, 1391 based on Foata normal form. 10/7881 useless extension candidates. Maximal degree in co-relation 70154. Up to 7769 conditions per place. [2024-06-14 16:06:48,731 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 425 selfloop transitions, 20 changer transitions 0/466 dead transitions. [2024-06-14 16:06:48,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 466 transitions, 8391 flow [2024-06-14 16:06:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:06:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:06:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-14 16:06:48,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 16:06:48,732 INFO L175 Difference]: Start difference. First operand has 322 places, 454 transitions, 7443 flow. Second operand 6 states and 96 transitions. [2024-06-14 16:06:48,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 466 transitions, 8391 flow [2024-06-14 16:06:51,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 466 transitions, 8284 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-14 16:06:51,225 INFO L231 Difference]: Finished difference. Result has 324 places, 456 transitions, 7420 flow [2024-06-14 16:06:51,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7336, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7420, PETRI_PLACES=324, PETRI_TRANSITIONS=456} [2024-06-14 16:06:51,226 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 282 predicate places. [2024-06-14 16:06:51,226 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 456 transitions, 7420 flow [2024-06-14 16:06:51,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:51,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:51,227 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-14 16:06:51,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 16:06:51,227 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:06:51,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash -823956048, now seen corresponding path program 1 times [2024-06-14 16:06:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968735620] [2024-06-14 16:06:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:51,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:00,634 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-14 16:07:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:00,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968735620] [2024-06-14 16:07:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968735620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:00,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886107689] [2024-06-14 16:07:00,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:00,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:00,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:00,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:07:00,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 456 transitions, 7420 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:00,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:00,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:07:00,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:03,597 INFO L124 PetriNetUnfolderBase]: 5261/8105 cut-off events. [2024-06-14 16:07:03,597 INFO L125 PetriNetUnfolderBase]: For 862868/862868 co-relation queries the response was YES. [2024-06-14 16:07:03,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71370 conditions, 8105 events. 5261/8105 cut-off events. For 862868/862868 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 47741 event pairs, 1383 based on Foata normal form. 4/8107 useless extension candidates. Maximal degree in co-relation 71214. Up to 7904 conditions per place. [2024-06-14 16:07:03,705 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 445 selfloop transitions, 61 changer transitions 0/509 dead transitions. [2024-06-14 16:07:03,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 509 transitions, 9091 flow [2024-06-14 16:07:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:07:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:07:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-14 16:07:03,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2024-06-14 16:07:03,708 INFO L175 Difference]: Start difference. First operand has 324 places, 456 transitions, 7420 flow. Second operand 9 states and 150 transitions. [2024-06-14 16:07:03,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 509 transitions, 9091 flow [2024-06-14 16:07:05,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 509 transitions, 9025 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-14 16:07:05,578 INFO L231 Difference]: Finished difference. Result has 331 places, 475 transitions, 7773 flow [2024-06-14 16:07:05,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7354, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7773, PETRI_PLACES=331, PETRI_TRANSITIONS=475} [2024-06-14 16:07:05,579 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 289 predicate places. [2024-06-14 16:07:05,579 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 475 transitions, 7773 flow [2024-06-14 16:07:05,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:05,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:05,579 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-14 16:07:05,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 16:07:05,579 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-14 16:07:05,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash 351986303, now seen corresponding path program 1 times [2024-06-14 16:07:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:05,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432116806] [2024-06-14 16:07:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:07:13,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:13,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432116806] [2024-06-14 16:07:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432116806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:13,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:07:13,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837595890] [2024-06-14 16:07:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:13,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:07:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:07:13,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:07:13,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:07:13,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 475 transitions, 7773 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-14 16:07:13,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:13,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:07:13,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:16,836 INFO L124 PetriNetUnfolderBase]: 5302/8177 cut-off events. [2024-06-14 16:07:16,837 INFO L125 PetriNetUnfolderBase]: For 909366/909370 co-relation queries the response was YES. [2024-06-14 16:07:16,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72920 conditions, 8177 events. 5302/8177 cut-off events. For 909366/909370 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 48448 event pairs, 1297 based on Foata normal form. 13/8188 useless extension candidates. Maximal degree in co-relation 72761. Up to 7921 conditions per place. [2024-06-14 16:07:16,964 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 481 selfloop transitions, 35 changer transitions 0/519 dead transitions. [2024-06-14 16:07:16,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 519 transitions, 8979 flow [2024-06-14 16:07:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:07:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:07:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-14 16:07:16,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2024-06-14 16:07:16,967 INFO L175 Difference]: Start difference. First operand has 331 places, 475 transitions, 7773 flow. Second operand 10 states and 166 transitions. [2024-06-14 16:07:16,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 519 transitions, 8979 flow [2024-06-14 16:07:18,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 519 transitions, 8889 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-14 16:07:18,905 INFO L231 Difference]: Finished difference. Result has 337 places, 476 transitions, 7805 flow [2024-06-14 16:07:18,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7685, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7805, PETRI_PLACES=337, PETRI_TRANSITIONS=476} [2024-06-14 16:07:18,906 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 295 predicate places. [2024-06-14 16:07:18,906 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 476 transitions, 7805 flow [2024-06-14 16:07:18,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-14 16:07:18,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:18,907 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-14 16:07:18,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 16:07:18,907 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-14 16:07:18,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1536053185, now seen corresponding path program 2 times [2024-06-14 16:07:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:18,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066746557] [2024-06-14 16:07:18,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:18,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:28,021 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-14 16:07:28,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066746557] [2024-06-14 16:07:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066746557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:28,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:07:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727372440] [2024-06-14 16:07:28,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:28,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:07:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:28,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:07:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:07:28,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:07:28,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 476 transitions, 7805 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-14 16:07:28,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:28,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:07:28,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:32,052 INFO L124 PetriNetUnfolderBase]: 5675/8772 cut-off events. [2024-06-14 16:07:32,052 INFO L125 PetriNetUnfolderBase]: For 1113616/1113620 co-relation queries the response was YES. [2024-06-14 16:07:32,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78650 conditions, 8772 events. 5675/8772 cut-off events. For 1113616/1113620 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 52616 event pairs, 1343 based on Foata normal form. 58/8828 useless extension candidates. Maximal degree in co-relation 78490. Up to 7971 conditions per place. [2024-06-14 16:07:32,170 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 476 selfloop transitions, 82 changer transitions 0/561 dead transitions. [2024-06-14 16:07:32,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 561 transitions, 9885 flow [2024-06-14 16:07:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-14 16:07:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-14 16:07:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 255 transitions. [2024-06-14 16:07:32,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 16:07:32,171 INFO L175 Difference]: Start difference. First operand has 337 places, 476 transitions, 7805 flow. Second operand 15 states and 255 transitions. [2024-06-14 16:07:32,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 561 transitions, 9885 flow [2024-06-14 16:07:34,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 561 transitions, 9779 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 16:07:34,038 INFO L231 Difference]: Finished difference. Result has 346 places, 488 transitions, 8162 flow [2024-06-14 16:07:34,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7699, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8162, PETRI_PLACES=346, PETRI_TRANSITIONS=488} [2024-06-14 16:07:34,039 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 304 predicate places. [2024-06-14 16:07:34,039 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 488 transitions, 8162 flow [2024-06-14 16:07:34,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-14 16:07:34,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:34,039 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-14 16:07:34,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 16:07:34,039 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-14 16:07:34,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1536283825, now seen corresponding path program 3 times [2024-06-14 16:07:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251430174] [2024-06-14 16:07:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:43,079 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-14 16:07:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251430174] [2024-06-14 16:07:43,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251430174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:43,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:43,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:07:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477322851] [2024-06-14 16:07:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:43,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:07:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:07:43,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:07:43,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:07:43,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 488 transitions, 8162 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-14 16:07:43,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:43,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:07:43,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:47,295 INFO L124 PetriNetUnfolderBase]: 6137/9514 cut-off events. [2024-06-14 16:07:47,295 INFO L125 PetriNetUnfolderBase]: For 1268993/1268997 co-relation queries the response was YES. [2024-06-14 16:07:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87349 conditions, 9514 events. 6137/9514 cut-off events. For 1268993/1268997 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 57996 event pairs, 1443 based on Foata normal form. 58/9570 useless extension candidates. Maximal degree in co-relation 87186. Up to 8327 conditions per place. [2024-06-14 16:07:47,439 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 478 selfloop transitions, 91 changer transitions 0/572 dead transitions. [2024-06-14 16:07:47,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 572 transitions, 10330 flow [2024-06-14 16:07:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-14 16:07:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-14 16:07:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 247 transitions. [2024-06-14 16:07:47,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43031358885017423 [2024-06-14 16:07:47,441 INFO L175 Difference]: Start difference. First operand has 346 places, 488 transitions, 8162 flow. Second operand 14 states and 247 transitions. [2024-06-14 16:07:47,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 572 transitions, 10330 flow [2024-06-14 16:07:49,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 572 transitions, 10138 flow, removed 53 selfloop flow, removed 9 redundant places. [2024-06-14 16:07:49,643 INFO L231 Difference]: Finished difference. Result has 352 places, 494 transitions, 8379 flow [2024-06-14 16:07:49,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7970, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8379, PETRI_PLACES=352, PETRI_TRANSITIONS=494} [2024-06-14 16:07:49,644 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 310 predicate places. [2024-06-14 16:07:49,644 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 494 transitions, 8379 flow [2024-06-14 16:07:49,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-14 16:07:49,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:49,645 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-14 16:07:49,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 16:07:49,645 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:07:49,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1051228616, now seen corresponding path program 2 times [2024-06-14 16:07:49,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:49,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357975930] [2024-06-14 16:07:49,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:59,038 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-14 16:07:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357975930] [2024-06-14 16:07:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357975930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:59,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:07:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255037139] [2024-06-14 16:07:59,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:59,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:07:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:59,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:07:59,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:07:59,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:07:59,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 494 transitions, 8379 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:07:59,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:59,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:07:59,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:02,716 INFO L124 PetriNetUnfolderBase]: 6163/9549 cut-off events. [2024-06-14 16:08:02,717 INFO L125 PetriNetUnfolderBase]: For 1168243/1168243 co-relation queries the response was YES. [2024-06-14 16:08:02,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88395 conditions, 9549 events. 6163/9549 cut-off events. For 1168243/1168243 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 58326 event pairs, 1893 based on Foata normal form. 2/9549 useless extension candidates. Maximal degree in co-relation 88229. Up to 9333 conditions per place. [2024-06-14 16:08:02,860 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 458 selfloop transitions, 69 changer transitions 0/530 dead transitions. [2024-06-14 16:08:02,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 530 transitions, 9945 flow [2024-06-14 16:08:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:08:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:08:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-14 16:08:02,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-14 16:08:02,861 INFO L175 Difference]: Start difference. First operand has 352 places, 494 transitions, 8379 flow. Second operand 9 states and 145 transitions. [2024-06-14 16:08:02,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 530 transitions, 9945 flow [2024-06-14 16:08:05,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 530 transitions, 9771 flow, removed 38 selfloop flow, removed 9 redundant places. [2024-06-14 16:08:05,285 INFO L231 Difference]: Finished difference. Result has 353 places, 504 transitions, 8510 flow [2024-06-14 16:08:05,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8206, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8510, PETRI_PLACES=353, PETRI_TRANSITIONS=504} [2024-06-14 16:08:05,286 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 311 predicate places. [2024-06-14 16:08:05,286 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 504 transitions, 8510 flow [2024-06-14 16:08:05,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:05,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:05,286 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-14 16:08:05,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 16:08:05,286 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:08:05,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash -814701618, now seen corresponding path program 3 times [2024-06-14 16:08:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059657541] [2024-06-14 16:08:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:15,492 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-14 16:08:15,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:15,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059657541] [2024-06-14 16:08:15,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059657541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:15,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:08:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513844876] [2024-06-14 16:08:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:15,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:08:15,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:15,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:08:15,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:08:15,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:08:15,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 504 transitions, 8510 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:15,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:15,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:08:15,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:18,987 INFO L124 PetriNetUnfolderBase]: 6147/9527 cut-off events. [2024-06-14 16:08:18,987 INFO L125 PetriNetUnfolderBase]: For 1177947/1177947 co-relation queries the response was YES. [2024-06-14 16:08:19,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87778 conditions, 9527 events. 6147/9527 cut-off events. For 1177947/1177947 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 58104 event pairs, 1843 based on Foata normal form. 4/9529 useless extension candidates. Maximal degree in co-relation 87609. Up to 9320 conditions per place. [2024-06-14 16:08:19,117 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 462 selfloop transitions, 65 changer transitions 0/530 dead transitions. [2024-06-14 16:08:19,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 530 transitions, 9812 flow [2024-06-14 16:08:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:08:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:08:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-14 16:08:19,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-14 16:08:19,119 INFO L175 Difference]: Start difference. First operand has 353 places, 504 transitions, 8510 flow. Second operand 9 states and 145 transitions. [2024-06-14 16:08:19,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 530 transitions, 9812 flow [2024-06-14 16:08:21,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 530 transitions, 9701 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-14 16:08:21,621 INFO L231 Difference]: Finished difference. Result has 358 places, 504 transitions, 8539 flow [2024-06-14 16:08:21,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8399, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8539, PETRI_PLACES=358, PETRI_TRANSITIONS=504} [2024-06-14 16:08:21,622 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 316 predicate places. [2024-06-14 16:08:21,622 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 504 transitions, 8539 flow [2024-06-14 16:08:21,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:21,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:21,622 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-14 16:08:21,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 16:08:21,623 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-14 16:08:21,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:21,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1541738881, now seen corresponding path program 4 times [2024-06-14 16:08:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:21,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603556660] [2024-06-14 16:08:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:21,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:30,103 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-14 16:08:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603556660] [2024-06-14 16:08:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603556660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:08:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256732547] [2024-06-14 16:08:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:30,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:08:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:08:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:08:30,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:08:30,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 504 transitions, 8539 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 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-14 16:08:30,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:30,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:08:30,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:33,884 INFO L124 PetriNetUnfolderBase]: 6188/9599 cut-off events. [2024-06-14 16:08:33,885 INFO L125 PetriNetUnfolderBase]: For 1228147/1228151 co-relation queries the response was YES. [2024-06-14 16:08:34,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88613 conditions, 9599 events. 6188/9599 cut-off events. For 1228147/1228151 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 58766 event pairs, 1885 based on Foata normal form. 16/9613 useless extension candidates. Maximal degree in co-relation 88443. Up to 9439 conditions per place. [2024-06-14 16:08:34,045 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 518 selfloop transitions, 18 changer transitions 0/539 dead transitions. [2024-06-14 16:08:34,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 539 transitions, 9765 flow [2024-06-14 16:08:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:08:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:08:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-14 16:08:34,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-14 16:08:34,048 INFO L175 Difference]: Start difference. First operand has 358 places, 504 transitions, 8539 flow. Second operand 9 states and 142 transitions. [2024-06-14 16:08:34,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 539 transitions, 9765 flow [2024-06-14 16:08:36,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 539 transitions, 9683 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 16:08:36,946 INFO L231 Difference]: Finished difference. Result has 362 places, 505 transitions, 8551 flow [2024-06-14 16:08:36,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8459, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8551, PETRI_PLACES=362, PETRI_TRANSITIONS=505} [2024-06-14 16:08:36,947 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 320 predicate places. [2024-06-14 16:08:36,947 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 505 transitions, 8551 flow [2024-06-14 16:08:36,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 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-14 16:08:36,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:36,948 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-14 16:08:36,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 16:08:36,948 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-14 16:08:36,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2078935267, now seen corresponding path program 5 times [2024-06-14 16:08:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:36,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812727692] [2024-06-14 16:08:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:45,088 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-14 16:08:45,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812727692] [2024-06-14 16:08:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812727692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 16:08:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131891116] [2024-06-14 16:08:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:45,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 16:08:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:45,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 16:08:45,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 16:08:45,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-14 16:08:45,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 505 transitions, 8551 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-14 16:08:45,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:45,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-14 16:08:45,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:49,092 INFO L124 PetriNetUnfolderBase]: 6229/9670 cut-off events. [2024-06-14 16:08:49,093 INFO L125 PetriNetUnfolderBase]: For 1263258/1263262 co-relation queries the response was YES. [2024-06-14 16:08:49,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89415 conditions, 9670 events. 6229/9670 cut-off events. For 1263258/1263262 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 59389 event pairs, 1843 based on Foata normal form. 16/9684 useless extension candidates. Maximal degree in co-relation 89245. Up to 9396 conditions per place. [2024-06-14 16:08:49,259 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 505 selfloop transitions, 32 changer transitions 0/540 dead transitions. [2024-06-14 16:08:49,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 540 transitions, 9777 flow [2024-06-14 16:08:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:08:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:08:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-14 16:08:49,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-14 16:08:49,262 INFO L175 Difference]: Start difference. First operand has 362 places, 505 transitions, 8551 flow. Second operand 9 states and 144 transitions. [2024-06-14 16:08:49,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 540 transitions, 9777 flow [2024-06-14 16:08:52,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 540 transitions, 9699 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-14 16:08:52,373 INFO L231 Difference]: Finished difference. Result has 364 places, 506 transitions, 8595 flow [2024-06-14 16:08:52,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8473, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8595, PETRI_PLACES=364, PETRI_TRANSITIONS=506} [2024-06-14 16:08:52,374 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 322 predicate places. [2024-06-14 16:08:52,374 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 506 transitions, 8595 flow [2024-06-14 16:08:52,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-14 16:08:52,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:52,374 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-14 16:08:52,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 16:08:52,375 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-14 16:08:52,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash 115231757, now seen corresponding path program 6 times [2024-06-14 16:08:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:52,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350383697] [2024-06-14 16:08:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15