./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_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/safe012_pso.oepc_pso.opt_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/safe012_pso.oepc_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe012_pso.oepc_pso.opt_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:56:20,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:56:20,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:56:20,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:56:20,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:56:20,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:56:20,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:56:20,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:56:20,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:56:20,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:56:20,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:56:20,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:56:20,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:56:20,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:56:20,682 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:56:20,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:56:20,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:56:20,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:56:20,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:56:20,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:56:20,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:56:20,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:56:20,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:56:20,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:56:20,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:56:20,694 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:56:20,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:56:20,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:56:20,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:56:20,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:56:20,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:56:20,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:56:20,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:56:20,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:56:20,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:56:20,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:56:20,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:56:20,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:56:20,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:56:20,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:56:20,699 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:56:20,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:56:20,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:56:20,700 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:56:20,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:56:20,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:56:20,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:56:20,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:56:20,980 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:56:20,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-14 15:56:22,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:56:22,479 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:56:22,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-14 15:56:22,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f105767b0/148a09b0520a45dda2d7db661ecdbed8/FLAG4ff3df253 [2024-06-14 15:56:22,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f105767b0/148a09b0520a45dda2d7db661ecdbed8 [2024-06-14 15:56:22,517 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:56:22,517 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:56:22,520 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/safe012_pso.oepc_pso.opt_rmo.opt.yml/witness.yml [2024-06-14 15:56:22,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:56:22,746 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:56:22,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:56:22,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:56:22,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:56:22,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:56:22" (1/2) ... [2024-06-14 15:56:22,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467636d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:56:22, skipping insertion in model container [2024-06-14 15:56:22,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:56:22" (1/2) ... [2024-06-14 15:56:22,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2821e88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:56:22, skipping insertion in model container [2024-06-14 15:56:22,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:56:22" (2/2) ... [2024-06-14 15:56:22,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467636d4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:22, skipping insertion in model container [2024-06-14 15:56:22,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:56:22" (2/2) ... [2024-06-14 15:56:22,757 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:56:22,856 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:56:22,857 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-14 15:56:22,858 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-14 15:56:22,859 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 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 )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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p2_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-14 15:56:22,859 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:56:22,860 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-14 15:56:22,912 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:56:23,272 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:56:23,284 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:56:23,750 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:56:23,797 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:56:23,797 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23 WrapperNode [2024-06-14 15:56:23,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:56:23,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:56:23,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:56:23,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:56:23,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:23,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:23,983 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2024-06-14 15:56:23,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:56:23,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:56:23,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:56:23,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:56:23,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:23,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,099 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:56:24,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:56:24,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:56:24,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:56:24,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:56:24,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (1/1) ... [2024-06-14 15:56:24,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:56:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:56:24,318 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:56:24,320 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:56:24,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:56:24,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:56:24,352 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:56:24,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:56:24,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:56:24,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:56:24,352 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 15:56:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 15:56:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:56:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:56:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:56:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:56:24,355 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:56:24,473 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:56:24,510 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:56:26,036 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:56:26,037 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:56:26,385 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:56:26,385 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:56:26,386 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:56:26 BoogieIcfgContainer [2024-06-14 15:56:26,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:56:26,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:56:26,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:56:26,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:56:26,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:56:22" (1/4) ... [2024-06-14 15:56:26,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f44e443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:56:26, skipping insertion in model container [2024-06-14 15:56:26,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:56:22" (2/4) ... [2024-06-14 15:56:26,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f44e443 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:56:26, skipping insertion in model container [2024-06-14 15:56:26,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:56:23" (3/4) ... [2024-06-14 15:56:26,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f44e443 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:56:26, skipping insertion in model container [2024-06-14 15:56:26,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:56:26" (4/4) ... [2024-06-14 15:56:26,396 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-14 15:56:26,412 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:56:26,413 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 15:56:26,413 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:56:26,546 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:56:26,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:56:26,648 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-14 15:56:26,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:56:26,651 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 62 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:56:26,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:56:26,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-14 15:56:26,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:56:26,669 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;@100a4c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:56:26,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 15:56:26,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:56:26,678 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:56:26,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:56:26,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:26,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:56:26,680 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:56:26,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1642983866, now seen corresponding path program 1 times [2024-06-14 15:56:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485671030] [2024-06-14 15:56:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485671030] [2024-06-14 15:56:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485671030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:33,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:56:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65143237] [2024-06-14 15:56:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:33,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:56:33,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:33,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:56:33,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:56:34,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-14 15:56:34,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:34,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:34,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-14 15:56:34,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:35,000 INFO L124 PetriNetUnfolderBase]: 897/1382 cut-off events. [2024-06-14 15:56:35,000 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-06-14 15:56:35,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 1382 events. 897/1382 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6517 event pairs, 581 based on Foata normal form. 1/1354 useless extension candidates. Maximal degree in co-relation 2799. Up to 1359 conditions per place. [2024-06-14 15:56:35,017 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-14 15:56:35,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 171 flow [2024-06-14 15:56:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:56:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:56:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-14 15:56:35,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-06-14 15:56:35,031 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 75 transitions. [2024-06-14 15:56:35,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 171 flow [2024-06-14 15:56:35,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 15:56:35,037 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-14 15:56:35,039 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:56:35,042 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-14 15:56:35,042 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-14 15:56:35,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:35,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:35,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:35,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:56:35,044 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:56:35,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash -684096459, now seen corresponding path program 1 times [2024-06-14 15:56:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682564739] [2024-06-14 15:56:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:42,296 INFO 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:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682564739] [2024-06-14 15:56:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682564739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:42,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:42,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:56:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506937112] [2024-06-14 15:56:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:42,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:56:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:56:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:56:42,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:56:42,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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:56:42,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:42,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:56:42,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:43,579 INFO L124 PetriNetUnfolderBase]: 1140/1737 cut-off events. [2024-06-14 15:56:43,579 INFO L125 PetriNetUnfolderBase]: For 348/360 co-relation queries the response was YES. [2024-06-14 15:56:43,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4027 conditions, 1737 events. 1140/1737 cut-off events. For 348/360 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8128 event pairs, 549 based on Foata normal form. 7/1738 useless extension candidates. Maximal degree in co-relation 4012. Up to 1684 conditions per place. [2024-06-14 15:56:43,594 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 35 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2024-06-14 15:56:43,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 212 flow [2024-06-14 15:56:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:56:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:56:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-14 15:56:43,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-06-14 15:56:43,599 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 3 states and 75 transitions. [2024-06-14 15:56:43,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 212 flow [2024-06-14 15:56:43,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:56:43,603 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 136 flow [2024-06-14 15:56:43,603 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-06-14 15:56:43,604 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-14 15:56:43,604 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 136 flow [2024-06-14 15:56:43,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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:56:43,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:43,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:43,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:56:43,609 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:56:43,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1007608238, now seen corresponding path program 1 times [2024-06-14 15:56:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515740795] [2024-06-14 15:56:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:43,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:50,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:56:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515740795] [2024-06-14 15:56:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515740795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:50,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:56:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615554419] [2024-06-14 15:56:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:50,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:56:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:56:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:56:50,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:56:50,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:50,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:50,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:56:50,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:51,394 INFO L124 PetriNetUnfolderBase]: 1131/1722 cut-off events. [2024-06-14 15:56:51,394 INFO L125 PetriNetUnfolderBase]: For 943/971 co-relation queries the response was YES. [2024-06-14 15:56:51,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 1722 events. 1131/1722 cut-off events. For 943/971 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7994 event pairs, 409 based on Foata normal form. 17/1734 useless extension candidates. Maximal degree in co-relation 4432. Up to 1639 conditions per place. [2024-06-14 15:56:51,407 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 39 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2024-06-14 15:56:51,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 268 flow [2024-06-14 15:56:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:56:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:56:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-14 15:56:51,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2024-06-14 15:56:51,414 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 136 flow. Second operand 4 states and 92 transitions. [2024-06-14 15:56:51,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 268 flow [2024-06-14 15:56:51,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:56:51,417 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 163 flow [2024-06-14 15:56:51,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-14 15:56:51,419 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-06-14 15:56:51,419 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 163 flow [2024-06-14 15:56:51,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:51,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:51,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:51,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:56:51,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:51,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash -813912086, now seen corresponding path program 1 times [2024-06-14 15:56:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:51,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175230594] [2024-06-14 15:56:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:51,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:59,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175230594] [2024-06-14 15:56:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175230594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:59,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:59,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:56:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793518158] [2024-06-14 15:56:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:59,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:56:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:59,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:56:59,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:56:59,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:56:59,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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:59,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:59,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:56:59,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:00,497 INFO L124 PetriNetUnfolderBase]: 888/1372 cut-off events. [2024-06-14 15:57:00,498 INFO L125 PetriNetUnfolderBase]: For 1358/1364 co-relation queries the response was YES. [2024-06-14 15:57:00,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1372 events. 888/1372 cut-off events. For 1358/1364 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6375 event pairs, 408 based on Foata normal form. 8/1377 useless extension candidates. Maximal degree in co-relation 3844. Up to 1326 conditions per place. [2024-06-14 15:57:00,505 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 40 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2024-06-14 15:57:00,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 305 flow [2024-06-14 15:57:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:57:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:57:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-14 15:57:00,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-14 15:57:00,507 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 163 flow. Second operand 5 states and 100 transitions. [2024-06-14 15:57:00,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 305 flow [2024-06-14 15:57:00,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 284 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 15:57:00,510 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 186 flow [2024-06-14 15:57:00,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-14 15:57:00,511 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2024-06-14 15:57:00,511 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 186 flow [2024-06-14 15:57:00,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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:00,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:00,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:00,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:57:00,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:57:00,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash 504568724, now seen corresponding path program 1 times [2024-06-14 15:57:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866172765] [2024-06-14 15:57:00,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:00,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:08,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:08,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866172765] [2024-06-14 15:57:08,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866172765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:08,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:08,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:57:08,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735798917] [2024-06-14 15:57:08,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:08,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:57:08,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:08,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:57:08,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:57:08,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:57:08,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:08,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:08,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:57:08,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:09,381 INFO L124 PetriNetUnfolderBase]: 1047/1602 cut-off events. [2024-06-14 15:57:09,382 INFO L125 PetriNetUnfolderBase]: For 2290/2290 co-relation queries the response was YES. [2024-06-14 15:57:09,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 1602 events. 1047/1602 cut-off events. For 2290/2290 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7593 event pairs, 479 based on Foata normal form. 4/1604 useless extension candidates. Maximal degree in co-relation 4836. Up to 1534 conditions per place. [2024-06-14 15:57:09,390 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 51 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-14 15:57:09,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 407 flow [2024-06-14 15:57:09,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:57:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:57:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 15:57:09,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-14 15:57:09,392 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 186 flow. Second operand 7 states and 125 transitions. [2024-06-14 15:57:09,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 407 flow [2024-06-14 15:57:09,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 380 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:57:09,396 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 269 flow [2024-06-14 15:57:09,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2024-06-14 15:57:09,397 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-14 15:57:09,398 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 269 flow [2024-06-14 15:57:09,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:09,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:09,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:09,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:57:09,399 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:57:09,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:09,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1538237355, now seen corresponding path program 1 times [2024-06-14 15:57:09,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198655677] [2024-06-14 15:57:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:19,436 INFO 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:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198655677] [2024-06-14 15:57:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198655677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:57:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491407094] [2024-06-14 15:57:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:57:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:57:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:57:19,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:57:19,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 269 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:19,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:19,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:57:19,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:20,603 INFO L124 PetriNetUnfolderBase]: 1042/1600 cut-off events. [2024-06-14 15:57:20,603 INFO L125 PetriNetUnfolderBase]: For 3350/3353 co-relation queries the response was YES. [2024-06-14 15:57:20,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5322 conditions, 1600 events. 1042/1600 cut-off events. For 3350/3353 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7648 event pairs, 461 based on Foata normal form. 2/1600 useless extension candidates. Maximal degree in co-relation 5297. Up to 1541 conditions per place. [2024-06-14 15:57:20,614 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 60 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-06-14 15:57:20,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 506 flow [2024-06-14 15:57:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:57:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:57:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 15:57:20,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-14 15:57:20,617 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 269 flow. Second operand 7 states and 129 transitions. [2024-06-14 15:57:20,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 506 flow [2024-06-14 15:57:20,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 500 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-14 15:57:20,625 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 364 flow [2024-06-14 15:57:20,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2024-06-14 15:57:20,628 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2024-06-14 15:57:20,628 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 364 flow [2024-06-14 15:57:20,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:20,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:20,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:20,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:57:20,629 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:57:20,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1162460103, now seen corresponding path program 1 times [2024-06-14 15:57:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501225572] [2024-06-14 15:57:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:29,412 INFO 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:29,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:29,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501225572] [2024-06-14 15:57:29,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501225572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:29,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:29,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:57:29,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329317209] [2024-06-14 15:57:29,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:29,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:57:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:57:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:57:29,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:57:29,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 364 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:29,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:29,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:57:29,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:30,653 INFO L124 PetriNetUnfolderBase]: 1242/1909 cut-off events. [2024-06-14 15:57:30,653 INFO L125 PetriNetUnfolderBase]: For 5760/5784 co-relation queries the response was YES. [2024-06-14 15:57:30,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6825 conditions, 1909 events. 1242/1909 cut-off events. For 5760/5784 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9109 event pairs, 447 based on Foata normal form. 12/1885 useless extension candidates. Maximal degree in co-relation 6795. Up to 1748 conditions per place. [2024-06-14 15:57:30,667 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 51 selfloop transitions, 17 changer transitions 0/79 dead transitions. [2024-06-14 15:57:30,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 79 transitions, 562 flow [2024-06-14 15:57:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:57:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:57:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-06-14 15:57:30,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48292682926829267 [2024-06-14 15:57:30,671 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 364 flow. Second operand 5 states and 99 transitions. [2024-06-14 15:57:30,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 79 transitions, 562 flow [2024-06-14 15:57:30,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 79 transitions, 547 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 15:57:30,677 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 427 flow [2024-06-14 15:57:30,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-06-14 15:57:30,678 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-14 15:57:30,679 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 427 flow [2024-06-14 15:57:30,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:30,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:30,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:30,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:57:30,680 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:57:30,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2131744735, now seen corresponding path program 1 times [2024-06-14 15:57:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:30,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068481039] [2024-06-14 15:57:30,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:40,772 INFO 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:40,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068481039] [2024-06-14 15:57:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068481039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:40,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:40,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:40,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979664602] [2024-06-14 15:57:40,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:40,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:40,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:40,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:40,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:40,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:57:40,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 427 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:40,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:40,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:57:40,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:41,953 INFO L124 PetriNetUnfolderBase]: 1095/1691 cut-off events. [2024-06-14 15:57:41,953 INFO L125 PetriNetUnfolderBase]: For 6374/6377 co-relation queries the response was YES. [2024-06-14 15:57:41,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6515 conditions, 1691 events. 1095/1691 cut-off events. For 6374/6377 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8270 event pairs, 435 based on Foata normal form. 22/1711 useless extension candidates. Maximal degree in co-relation 6483. Up to 1490 conditions per place. [2024-06-14 15:57:41,967 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 67 selfloop transitions, 24 changer transitions 0/96 dead transitions. [2024-06-14 15:57:41,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 715 flow [2024-06-14 15:57:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:57:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:57:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 15:57:41,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-14 15:57:41,971 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 427 flow. Second operand 8 states and 154 transitions. [2024-06-14 15:57:41,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 715 flow [2024-06-14 15:57:41,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 671 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-14 15:57:41,979 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 494 flow [2024-06-14 15:57:41,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=494, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-06-14 15:57:41,980 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-14 15:57:41,980 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 494 flow [2024-06-14 15:57:41,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:41,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:41,981 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:41,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:57:41,981 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:57:41,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1984766159, now seen corresponding path program 1 times [2024-06-14 15:57:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033174499] [2024-06-14 15:57:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:51,293 INFO 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:51,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:51,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033174499] [2024-06-14 15:57:51,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033174499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:51,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896963696] [2024-06-14 15:57:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:51,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:51,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:51,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:57:51,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 494 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:51,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:51,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:57:51,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:52,391 INFO L124 PetriNetUnfolderBase]: 1355/2069 cut-off events. [2024-06-14 15:57:52,392 INFO L125 PetriNetUnfolderBase]: For 8495/8495 co-relation queries the response was YES. [2024-06-14 15:57:52,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8154 conditions, 2069 events. 1355/2069 cut-off events. For 8495/8495 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9743 event pairs, 476 based on Foata normal form. 2/2067 useless extension candidates. Maximal degree in co-relation 8120. Up to 1921 conditions per place. [2024-06-14 15:57:52,406 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 70 selfloop transitions, 23 changer transitions 0/97 dead transitions. [2024-06-14 15:57:52,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 97 transitions, 790 flow [2024-06-14 15:57:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:57:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:57:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-14 15:57:52,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2024-06-14 15:57:52,410 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 494 flow. Second operand 6 states and 113 transitions. [2024-06-14 15:57:52,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 97 transitions, 790 flow [2024-06-14 15:57:52,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 756 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:57:52,421 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 615 flow [2024-06-14 15:57:52,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2024-06-14 15:57:52,422 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2024-06-14 15:57:52,422 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 615 flow [2024-06-14 15:57:52,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:52,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:52,422 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,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:57:52,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1183686085, now seen corresponding path program 1 times [2024-06-14 15:57:52,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:52,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563027375] [2024-06-14 15:57:52,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:52,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:05,840 INFO 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:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563027375] [2024-06-14 15:58:05,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563027375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:58:05,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325631708] [2024-06-14 15:58:05,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:05,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:58:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:05,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:58:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:58:05,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:58:05,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 615 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 15:58:05,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:05,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:58:05,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:06,837 INFO L124 PetriNetUnfolderBase]: 1349/2061 cut-off events. [2024-06-14 15:58:06,837 INFO L125 PetriNetUnfolderBase]: For 10181/10181 co-relation queries the response was YES. [2024-06-14 15:58:06,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8665 conditions, 2061 events. 1349/2061 cut-off events. For 10181/10181 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9669 event pairs, 462 based on Foata normal form. 2/2061 useless extension candidates. Maximal degree in co-relation 8627. Up to 2021 conditions per place. [2024-06-14 15:58:06,850 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 83 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2024-06-14 15:58:06,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 887 flow [2024-06-14 15:58:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:58:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:58:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-14 15:58:06,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43414634146341463 [2024-06-14 15:58:06,851 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 615 flow. Second operand 5 states and 89 transitions. [2024-06-14 15:58:06,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 887 flow [2024-06-14 15:58:06,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 96 transitions, 865 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-14 15:58:06,861 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 686 flow [2024-06-14 15:58:06,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=686, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2024-06-14 15:58:06,862 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-14 15:58:06,862 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 686 flow [2024-06-14 15:58:06,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 15:58:06,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:06,862 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:06,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:58:06,863 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:58:06,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash -817879428, now seen corresponding path program 1 times [2024-06-14 15:58:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:06,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37117756] [2024-06-14 15:58:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:15,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:15,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37117756] [2024-06-14 15:58:15,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37117756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:15,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:15,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:58:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089667290] [2024-06-14 15:58:15,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:15,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:58:15,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:15,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:58:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:58:15,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:58:16,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 686 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:16,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:16,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:58:16,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:17,031 INFO L124 PetriNetUnfolderBase]: 1300/2015 cut-off events. [2024-06-14 15:58:17,032 INFO L125 PetriNetUnfolderBase]: For 10712/10720 co-relation queries the response was YES. [2024-06-14 15:58:17,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8584 conditions, 2015 events. 1300/2015 cut-off events. For 10712/10720 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9808 event pairs, 299 based on Foata normal form. 10/1986 useless extension candidates. Maximal degree in co-relation 8542. Up to 1831 conditions per place. [2024-06-14 15:58:17,044 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 72 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2024-06-14 15:58:17,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 105 transitions, 922 flow [2024-06-14 15:58:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:58:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:58:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-14 15:58:17,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:58:17,047 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 686 flow. Second operand 6 states and 114 transitions. [2024-06-14 15:58:17,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 105 transitions, 922 flow [2024-06-14 15:58:17,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 105 transitions, 914 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-14 15:58:17,057 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 737 flow [2024-06-14 15:58:17,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=737, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2024-06-14 15:58:17,058 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2024-06-14 15:58:17,058 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 737 flow [2024-06-14 15:58:17,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:17,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:17,059 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:17,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:58:17,059 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:58:17,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash -432623624, now seen corresponding path program 2 times [2024-06-14 15:58:17,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:17,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207342760] [2024-06-14 15:58:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:17,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:26,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:26,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207342760] [2024-06-14 15:58:26,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207342760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:26,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:26,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:58:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468585437] [2024-06-14 15:58:26,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:26,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:58:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:26,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:58:26,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:58:26,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:58:26,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 737 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:26,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:26,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:58:26,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:27,402 INFO L124 PetriNetUnfolderBase]: 1288/1997 cut-off events. [2024-06-14 15:58:27,403 INFO L125 PetriNetUnfolderBase]: For 12638/12653 co-relation queries the response was YES. [2024-06-14 15:58:27,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8865 conditions, 1997 events. 1288/1997 cut-off events. For 12638/12653 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9694 event pairs, 400 based on Foata normal form. 8/1967 useless extension candidates. Maximal degree in co-relation 8820. Up to 1794 conditions per place. [2024-06-14 15:58:27,414 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 66 selfloop transitions, 26 changer transitions 0/108 dead transitions. [2024-06-14 15:58:27,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 108 transitions, 993 flow [2024-06-14 15:58:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:58:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:58:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-14 15:58:27,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-14 15:58:27,416 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 737 flow. Second operand 6 states and 116 transitions. [2024-06-14 15:58:27,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 108 transitions, 993 flow [2024-06-14 15:58:27,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 108 transitions, 952 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:58:27,429 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 780 flow [2024-06-14 15:58:27,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2024-06-14 15:58:27,430 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-14 15:58:27,430 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 780 flow [2024-06-14 15:58:27,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:27,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:27,431 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:27,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:58:27,431 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:58:27,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash -432618664, now seen corresponding path program 1 times [2024-06-14 15:58:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:27,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663291322] [2024-06-14 15:58:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:27,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:37,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663291322] [2024-06-14 15:58:37,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663291322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:37,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:58:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957186531] [2024-06-14 15:58:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:37,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:58:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:58:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:58:37,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:58:37,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 780 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:37,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:37,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:58:37,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:38,762 INFO L124 PetriNetUnfolderBase]: 1372/2102 cut-off events. [2024-06-14 15:58:38,762 INFO L125 PetriNetUnfolderBase]: For 13428/13428 co-relation queries the response was YES. [2024-06-14 15:58:38,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9532 conditions, 2102 events. 1372/2102 cut-off events. For 13428/13428 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9969 event pairs, 421 based on Foata normal form. 2/2100 useless extension candidates. Maximal degree in co-relation 9486. Up to 1940 conditions per place. [2024-06-14 15:58:38,774 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 86 selfloop transitions, 26 changer transitions 0/116 dead transitions. [2024-06-14 15:58:38,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 116 transitions, 1097 flow [2024-06-14 15:58:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:58:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:58:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-14 15:58:38,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564459930313589 [2024-06-14 15:58:38,778 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 780 flow. Second operand 7 states and 131 transitions. [2024-06-14 15:58:38,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 116 transitions, 1097 flow [2024-06-14 15:58:38,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 116 transitions, 1037 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:58:38,795 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 816 flow [2024-06-14 15:58:38,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=816, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2024-06-14 15:58:38,796 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2024-06-14 15:58:38,796 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 816 flow [2024-06-14 15:58:38,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:38,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:38,797 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:38,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:58:38,797 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:58:38,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:38,798 INFO L85 PathProgramCache]: Analyzing trace with hash -317148004, now seen corresponding path program 2 times [2024-06-14 15:58:38,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691316902] [2024-06-14 15:58:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:49,409 INFO 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:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691316902] [2024-06-14 15:58:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691316902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:58:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354847703] [2024-06-14 15:58:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:58:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:58:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:58:49,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:58:49,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 816 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:49,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:49,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:58:49,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:50,684 INFO L124 PetriNetUnfolderBase]: 1367/2097 cut-off events. [2024-06-14 15:58:50,684 INFO L125 PetriNetUnfolderBase]: For 15413/15416 co-relation queries the response was YES. [2024-06-14 15:58:50,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9917 conditions, 2097 events. 1367/2097 cut-off events. For 15413/15416 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10004 event pairs, 415 based on Foata normal form. 4/2098 useless extension candidates. Maximal degree in co-relation 9870. Up to 1934 conditions per place. [2024-06-14 15:58:50,699 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 92 selfloop transitions, 26 changer transitions 0/122 dead transitions. [2024-06-14 15:58:50,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 1157 flow [2024-06-14 15:58:50,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:58:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:58:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-14 15:58:50,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-14 15:58:50,704 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 816 flow. Second operand 8 states and 146 transitions. [2024-06-14 15:58:50,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 1157 flow [2024-06-14 15:58:50,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 122 transitions, 1098 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 15:58:50,726 INFO L231 Difference]: Finished difference. Result has 95 places, 96 transitions, 855 flow [2024-06-14 15:58:50,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=855, PETRI_PLACES=95, PETRI_TRANSITIONS=96} [2024-06-14 15:58:50,728 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2024-06-14 15:58:50,728 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 96 transitions, 855 flow [2024-06-14 15:58:50,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:50,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:50,728 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 15:58:50,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:58:50,729 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:58:50,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -614994862, now seen corresponding path program 1 times [2024-06-14 15:58:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:50,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300090310] [2024-06-14 15:58:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:00,244 INFO 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,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300090310] [2024-06-14 15:59:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300090310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:00,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:00,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:00,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310092108] [2024-06-14 15:59:00,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:00,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:00,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:00,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:59:00,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 855 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:00,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:00,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:59:00,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:01,424 INFO L124 PetriNetUnfolderBase]: 1384/2122 cut-off events. [2024-06-14 15:59:01,425 INFO L125 PetriNetUnfolderBase]: For 18336/18336 co-relation queries the response was YES. [2024-06-14 15:59:01,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10413 conditions, 2122 events. 1384/2122 cut-off events. For 18336/18336 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10060 event pairs, 258 based on Foata normal form. 4/2122 useless extension candidates. Maximal degree in co-relation 10365. Up to 1980 conditions per place. [2024-06-14 15:59:01,437 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 107 selfloop transitions, 14 changer transitions 0/125 dead transitions. [2024-06-14 15:59:01,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 125 transitions, 1214 flow [2024-06-14 15:59:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 15:59:01,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-14 15:59:01,440 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 855 flow. Second operand 7 states and 125 transitions. [2024-06-14 15:59:01,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 125 transitions, 1214 flow [2024-06-14 15:59:01,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 125 transitions, 1140 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:59:01,459 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 886 flow [2024-06-14 15:59:01,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=886, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2024-06-14 15:59:01,460 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-14 15:59:01,460 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 886 flow [2024-06-14 15:59:01,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:01,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:01,461 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 15:59:01,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:59:01,461 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:59:01,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash -526425382, now seen corresponding path program 2 times [2024-06-14 15:59:01,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623552585] [2024-06-14 15:59:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:01,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:10,638 INFO 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:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623552585] [2024-06-14 15:59:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623552585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:10,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:10,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437103208] [2024-06-14 15:59:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:10,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:10,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:10,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:10,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:59:10,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 886 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:10,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:10,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:59:10,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:11,822 INFO L124 PetriNetUnfolderBase]: 1401/2149 cut-off events. [2024-06-14 15:59:11,822 INFO L125 PetriNetUnfolderBase]: For 20629/20629 co-relation queries the response was YES. [2024-06-14 15:59:11,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10762 conditions, 2149 events. 1401/2149 cut-off events. For 20629/20629 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10236 event pairs, 382 based on Foata normal form. 4/2149 useless extension candidates. Maximal degree in co-relation 10711. Up to 1973 conditions per place. [2024-06-14 15:59:11,835 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 97 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2024-06-14 15:59:11,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 127 transitions, 1219 flow [2024-06-14 15:59:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 15:59:11,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-14 15:59:11,839 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 886 flow. Second operand 7 states and 129 transitions. [2024-06-14 15:59:11,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 127 transitions, 1219 flow [2024-06-14 15:59:11,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 127 transitions, 1172 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-14 15:59:11,865 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 925 flow [2024-06-14 15:59:11,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=925, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2024-06-14 15:59:11,865 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2024-06-14 15:59:11,866 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 925 flow [2024-06-14 15:59:11,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:11,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:11,866 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 15:59:11,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:59:11,866 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:59:11,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash -526429102, now seen corresponding path program 3 times [2024-06-14 15:59:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:11,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654733685] [2024-06-14 15:59:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:20,538 INFO 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:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654733685] [2024-06-14 15:59:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654733685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:20,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545176016] [2024-06-14 15:59:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:20,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:20,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:20,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:59:20,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 925 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:20,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:20,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:59:20,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:21,783 INFO L124 PetriNetUnfolderBase]: 1393/2137 cut-off events. [2024-06-14 15:59:21,783 INFO L125 PetriNetUnfolderBase]: For 22645/22645 co-relation queries the response was YES. [2024-06-14 15:59:21,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10986 conditions, 2137 events. 1393/2137 cut-off events. For 22645/22645 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10180 event pairs, 373 based on Foata normal form. 4/2137 useless extension candidates. Maximal degree in co-relation 10933. Up to 1915 conditions per place. [2024-06-14 15:59:21,795 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 100 selfloop transitions, 27 changer transitions 0/131 dead transitions. [2024-06-14 15:59:21,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1290 flow [2024-06-14 15:59:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 15:59:21,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-14 15:59:21,798 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 925 flow. Second operand 7 states and 129 transitions. [2024-06-14 15:59:21,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1290 flow [2024-06-14 15:59:21,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 131 transitions, 1224 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 15:59:21,822 INFO L231 Difference]: Finished difference. Result has 106 places, 108 transitions, 982 flow [2024-06-14 15:59:21,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=982, PETRI_PLACES=106, PETRI_TRANSITIONS=108} [2024-06-14 15:59:21,823 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-14 15:59:21,823 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 108 transitions, 982 flow [2024-06-14 15:59:21,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:21,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:21,824 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 15:59:21,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:59:21,824 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:59:21,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:21,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1051137324, now seen corresponding path program 1 times [2024-06-14 15:59:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:21,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959262099] [2024-06-14 15:59:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:33,115 INFO 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:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959262099] [2024-06-14 15:59:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959262099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:59:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337573190] [2024-06-14 15:59:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:33,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:59:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:59:33,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:59:33,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:59:33,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 108 transitions, 982 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:33,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:33,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:59:33,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:34,536 INFO L124 PetriNetUnfolderBase]: 1451/2245 cut-off events. [2024-06-14 15:59:34,536 INFO L125 PetriNetUnfolderBase]: For 27333/27333 co-relation queries the response was YES. [2024-06-14 15:59:34,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11723 conditions, 2245 events. 1451/2245 cut-off events. For 27333/27333 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10936 event pairs, 341 based on Foata normal form. 16/2257 useless extension candidates. Maximal degree in co-relation 11668. Up to 1935 conditions per place. [2024-06-14 15:59:34,551 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 109 selfloop transitions, 29 changer transitions 0/142 dead transitions. [2024-06-14 15:59:34,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 142 transitions, 1394 flow [2024-06-14 15:59:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:59:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:59:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 15:59:34,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-14 15:59:34,555 INFO L175 Difference]: Start difference. First operand has 106 places, 108 transitions, 982 flow. Second operand 8 states and 151 transitions. [2024-06-14 15:59:34,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 142 transitions, 1394 flow [2024-06-14 15:59:34,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 142 transitions, 1312 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 15:59:34,581 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 999 flow [2024-06-14 15:59:34,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=999, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2024-06-14 15:59:34,582 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-14 15:59:34,582 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 999 flow [2024-06-14 15:59:34,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:34,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:34,583 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 15:59:34,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:59:34,583 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:59:34,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1195237104, now seen corresponding path program 2 times [2024-06-14 15:59:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:34,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881509767] [2024-06-14 15:59:34,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881509767] [2024-06-14 15:59:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881509767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:44,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:44,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:59:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294391889] [2024-06-14 15:59:44,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:44,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:59:44,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:44,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:59:44,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:59:44,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:59:44,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 999 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:44,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:44,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:59:44,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:45,705 INFO L124 PetriNetUnfolderBase]: 1553/2421 cut-off events. [2024-06-14 15:59:45,705 INFO L125 PetriNetUnfolderBase]: For 31343/31346 co-relation queries the response was YES. [2024-06-14 15:59:45,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12851 conditions, 2421 events. 1553/2421 cut-off events. For 31343/31346 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12101 event pairs, 376 based on Foata normal form. 14/2432 useless extension candidates. Maximal degree in co-relation 12795. Up to 1913 conditions per place. [2024-06-14 15:59:45,719 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 118 selfloop transitions, 30 changer transitions 0/152 dead transitions. [2024-06-14 15:59:45,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 152 transitions, 1538 flow [2024-06-14 15:59:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:59:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:59:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-14 15:59:45,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-14 15:59:45,723 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 999 flow. Second operand 9 states and 169 transitions. [2024-06-14 15:59:45,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 152 transitions, 1538 flow [2024-06-14 15:59:45,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 152 transitions, 1478 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:59:45,748 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 1047 flow [2024-06-14 15:59:45,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1047, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2024-06-14 15:59:45,749 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-14 15:59:45,749 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 1047 flow [2024-06-14 15:59:45,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:45,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:45,750 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 15:59:45,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:59:45,750 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:59:45,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1195229664, now seen corresponding path program 3 times [2024-06-14 15:59:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:45,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865703108] [2024-06-14 15:59:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:55,649 INFO 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:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865703108] [2024-06-14 15:59:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865703108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:55,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:55,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:59:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172823348] [2024-06-14 15:59:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:55,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:59:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:59:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:59:55,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:59:55,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 1047 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:55,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:55,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:59:55,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:57,062 INFO L124 PetriNetUnfolderBase]: 1525/2375 cut-off events. [2024-06-14 15:59:57,063 INFO L125 PetriNetUnfolderBase]: For 32983/32983 co-relation queries the response was YES. [2024-06-14 15:59:57,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12540 conditions, 2375 events. 1525/2375 cut-off events. For 32983/32983 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11802 event pairs, 411 based on Foata normal form. 16/2387 useless extension candidates. Maximal degree in co-relation 12483. Up to 2070 conditions per place. [2024-06-14 15:59:57,080 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 106 selfloop transitions, 37 changer transitions 0/147 dead transitions. [2024-06-14 15:59:57,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 147 transitions, 1448 flow [2024-06-14 15:59:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:59:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:59:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-14 15:59:57,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-14 15:59:57,084 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 1047 flow. Second operand 9 states and 156 transitions. [2024-06-14 15:59:57,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 147 transitions, 1448 flow [2024-06-14 15:59:57,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 147 transitions, 1394 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-14 15:59:57,124 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 1074 flow [2024-06-14 15:59:57,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1074, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2024-06-14 15:59:57,125 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-14 15:59:57,125 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 1074 flow [2024-06-14 15:59:57,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:57,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:57,125 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 15:59:57,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:59:57,126 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:59:57,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1635515274, now seen corresponding path program 1 times [2024-06-14 15:59:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442940989] [2024-06-14 15:59:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:10,447 INFO 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,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:10,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442940989] [2024-06-14 16:00:10,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442940989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:10,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:10,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:00:10,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61821396] [2024-06-14 16:00:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:10,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:00:10,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:10,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:00:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:00:10,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:00:10,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 1074 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:00:10,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:10,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:00:10,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:11,619 INFO L124 PetriNetUnfolderBase]: 1545/2407 cut-off events. [2024-06-14 16:00:11,620 INFO L125 PetriNetUnfolderBase]: For 33167/33167 co-relation queries the response was YES. [2024-06-14 16:00:11,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12828 conditions, 2407 events. 1545/2407 cut-off events. For 33167/33167 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12017 event pairs, 414 based on Foata normal form. 4/2407 useless extension candidates. Maximal degree in co-relation 12769. Up to 2292 conditions per place. [2024-06-14 16:00:11,633 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 102 selfloop transitions, 19 changer transitions 0/125 dead transitions. [2024-06-14 16:00:11,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 125 transitions, 1376 flow [2024-06-14 16:00:11,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:00:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:00:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-14 16:00:11,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2024-06-14 16:00:11,636 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 1074 flow. Second operand 5 states and 93 transitions. [2024-06-14 16:00:11,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 125 transitions, 1376 flow [2024-06-14 16:00:11,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 125 transitions, 1292 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 16:00:11,664 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 1073 flow [2024-06-14 16:00:11,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1073, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2024-06-14 16:00:11,665 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-14 16:00:11,665 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 1073 flow [2024-06-14 16:00:11,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:00:11,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:11,665 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:11,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 16:00:11,665 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:00:11,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash 198965240, now seen corresponding path program 2 times [2024-06-14 16:00:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731638970] [2024-06-14 16:00:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:26,045 INFO 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:26,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731638970] [2024-06-14 16:00:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731638970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:26,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:26,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:00:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622749639] [2024-06-14 16:00:26,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:26,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:00:26,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:26,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:00:26,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:00:26,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:00:26,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 1073 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:00:26,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:26,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:00:26,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:27,209 INFO L124 PetriNetUnfolderBase]: 1533/2391 cut-off events. [2024-06-14 16:00:27,209 INFO L125 PetriNetUnfolderBase]: For 34957/34957 co-relation queries the response was YES. [2024-06-14 16:00:27,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12943 conditions, 2391 events. 1533/2391 cut-off events. For 34957/34957 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11898 event pairs, 412 based on Foata normal form. 4/2391 useless extension candidates. Maximal degree in co-relation 12883. Up to 2260 conditions per place. [2024-06-14 16:00:27,226 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 105 selfloop transitions, 22 changer transitions 0/131 dead transitions. [2024-06-14 16:00:27,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 131 transitions, 1405 flow [2024-06-14 16:00:27,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:00:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:00:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-14 16:00:27,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 16:00:27,227 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 1073 flow. Second operand 6 states and 108 transitions. [2024-06-14 16:00:27,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 131 transitions, 1405 flow [2024-06-14 16:00:27,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 131 transitions, 1350 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-14 16:00:27,256 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 1108 flow [2024-06-14 16:00:27,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1108, PETRI_PLACES=117, PETRI_TRANSITIONS=118} [2024-06-14 16:00:27,257 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-14 16:00:27,257 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 1108 flow [2024-06-14 16:00:27,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:00:27,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:27,257 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:27,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 16:00:27,257 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:00:27,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -955240478, now seen corresponding path program 1 times [2024-06-14 16:00:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609018327] [2024-06-14 16:00:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:38,112 INFO 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:38,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609018327] [2024-06-14 16:00:38,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609018327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:38,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:00:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618919748] [2024-06-14 16:00:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:38,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:00:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:00:38,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:00:38,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:00:38,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 1108 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:38,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:38,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:00:38,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:39,200 INFO L124 PetriNetUnfolderBase]: 1442/2296 cut-off events. [2024-06-14 16:00:39,200 INFO L125 PetriNetUnfolderBase]: For 35872/35877 co-relation queries the response was YES. [2024-06-14 16:00:39,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12860 conditions, 2296 events. 1442/2296 cut-off events. For 35872/35877 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11607 event pairs, 395 based on Foata normal form. 3/2293 useless extension candidates. Maximal degree in co-relation 12799. Up to 2135 conditions per place. [2024-06-14 16:00:39,215 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 108 selfloop transitions, 28 changer transitions 0/143 dead transitions. [2024-06-14 16:00:39,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 143 transitions, 1568 flow [2024-06-14 16:00:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:00:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:00:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 16:00:39,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45993031358885017 [2024-06-14 16:00:39,216 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 1108 flow. Second operand 7 states and 132 transitions. [2024-06-14 16:00:39,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 143 transitions, 1568 flow [2024-06-14 16:00:39,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 143 transitions, 1506 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 16:00:39,246 INFO L231 Difference]: Finished difference. Result has 120 places, 124 transitions, 1199 flow [2024-06-14 16:00:39,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1199, PETRI_PLACES=120, PETRI_TRANSITIONS=124} [2024-06-14 16:00:39,247 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2024-06-14 16:00:39,247 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 124 transitions, 1199 flow [2024-06-14 16:00:39,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:39,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:39,248 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:39,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 16:00:39,248 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 16:00:39,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -955120508, now seen corresponding path program 2 times [2024-06-14 16:00:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:39,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684110585] [2024-06-14 16:00:39,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:50,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:00:50,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:50,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684110585] [2024-06-14 16:00:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684110585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:50,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:50,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:00:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469427255] [2024-06-14 16:00:50,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:50,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:00:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:00:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:00:50,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:00:50,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 124 transitions, 1199 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:50,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:50,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:00:50,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:51,320 INFO L124 PetriNetUnfolderBase]: 1470/2340 cut-off events. [2024-06-14 16:00:51,320 INFO L125 PetriNetUnfolderBase]: For 40062/40067 co-relation queries the response was YES. [2024-06-14 16:00:51,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13493 conditions, 2340 events. 1470/2340 cut-off events. For 40062/40067 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11899 event pairs, 396 based on Foata normal form. 3/2337 useless extension candidates. Maximal degree in co-relation 13431. Up to 2215 conditions per place. [2024-06-14 16:00:51,335 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 113 selfloop transitions, 25 changer transitions 0/145 dead transitions. [2024-06-14 16:00:51,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 145 transitions, 1609 flow [2024-06-14 16:00:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:00:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:00:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 16:00:51,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-14 16:00:51,337 INFO L175 Difference]: Start difference. First operand has 120 places, 124 transitions, 1199 flow. Second operand 7 states and 127 transitions. [2024-06-14 16:00:51,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 145 transitions, 1609 flow [2024-06-14 16:00:51,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 145 transitions, 1550 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-14 16:00:51,374 INFO L231 Difference]: Finished difference. Result has 124 places, 130 transitions, 1282 flow [2024-06-14 16:00:51,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1282, PETRI_PLACES=124, PETRI_TRANSITIONS=130} [2024-06-14 16:00:51,374 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places. [2024-06-14 16:00:51,374 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 130 transitions, 1282 flow [2024-06-14 16:00:51,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:51,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:51,375 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:51,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 16:00:51,375 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:00:51,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash -955120322, now seen corresponding path program 1 times [2024-06-14 16:00:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:51,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665206043] [2024-06-14 16:00:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:02,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 16:01:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665206043] [2024-06-14 16:01:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665206043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:02,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:01:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119900265] [2024-06-14 16:01:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:02,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:01:02,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:02,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:01:02,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:01:02,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:01:02,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 130 transitions, 1282 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:01:02,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:02,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:01:02,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:03,443 INFO L124 PetriNetUnfolderBase]: 1604/2485 cut-off events. [2024-06-14 16:01:03,443 INFO L125 PetriNetUnfolderBase]: For 42952/42952 co-relation queries the response was YES. [2024-06-14 16:01:03,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14202 conditions, 2485 events. 1604/2485 cut-off events. For 42952/42952 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12269 event pairs, 398 based on Foata normal form. 2/2485 useless extension candidates. Maximal degree in co-relation 14138. Up to 2402 conditions per place. [2024-06-14 16:01:03,459 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 139 selfloop transitions, 20 changer transitions 0/163 dead transitions. [2024-06-14 16:01:03,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 163 transitions, 1837 flow [2024-06-14 16:01:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:01:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:01:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-14 16:01:03,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 16:01:03,461 INFO L175 Difference]: Start difference. First operand has 124 places, 130 transitions, 1282 flow. Second operand 7 states and 123 transitions. [2024-06-14 16:01:03,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 163 transitions, 1837 flow [2024-06-14 16:01:03,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 163 transitions, 1746 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 16:01:03,512 INFO L231 Difference]: Finished difference. Result has 130 places, 145 transitions, 1409 flow [2024-06-14 16:01:03,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1409, PETRI_PLACES=130, PETRI_TRANSITIONS=145} [2024-06-14 16:01:03,513 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 88 predicate places. [2024-06-14 16:01:03,513 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 145 transitions, 1409 flow [2024-06-14 16:01:03,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:01:03,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:03,513 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:03,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 16:01:03,514 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:01:03,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash 198733856, now seen corresponding path program 3 times [2024-06-14 16:01:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:03,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065862454] [2024-06-14 16:01:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:14,169 INFO 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:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065862454] [2024-06-14 16:01:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065862454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:14,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:01:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054835223] [2024-06-14 16:01:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:14,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:01:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:14,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:01:14,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:01:14,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:01:14,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 145 transitions, 1409 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:01:14,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:14,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:01:14,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:15,270 INFO L124 PetriNetUnfolderBase]: 1507/2381 cut-off events. [2024-06-14 16:01:15,270 INFO L125 PetriNetUnfolderBase]: For 45623/45626 co-relation queries the response was YES. [2024-06-14 16:01:15,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14075 conditions, 2381 events. 1507/2381 cut-off events. For 45623/45626 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11999 event pairs, 394 based on Foata normal form. 3/2382 useless extension candidates. Maximal degree in co-relation 14007. Up to 2204 conditions per place. [2024-06-14 16:01:15,290 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 120 selfloop transitions, 30 changer transitions 0/161 dead transitions. [2024-06-14 16:01:15,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 161 transitions, 1761 flow [2024-06-14 16:01:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:01:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:01:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-14 16:01:15,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-14 16:01:15,293 INFO L175 Difference]: Start difference. First operand has 130 places, 145 transitions, 1409 flow. Second operand 6 states and 116 transitions. [2024-06-14 16:01:15,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 161 transitions, 1761 flow [2024-06-14 16:01:15,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 161 transitions, 1711 flow, removed 24 selfloop flow, removed 1 redundant places. [2024-06-14 16:01:15,352 INFO L231 Difference]: Finished difference. Result has 135 places, 145 transitions, 1434 flow [2024-06-14 16:01:15,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1434, PETRI_PLACES=135, PETRI_TRANSITIONS=145} [2024-06-14 16:01:15,353 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-14 16:01:15,353 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 145 transitions, 1434 flow [2024-06-14 16:01:15,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:01:15,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:15,354 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:15,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 16:01:15,354 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:01:15,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:15,354 INFO L85 PathProgramCache]: Analyzing trace with hash 198971192, now seen corresponding path program 2 times [2024-06-14 16:01:15,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:15,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670771276] [2024-06-14 16:01:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:15,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:25,756 INFO 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:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670771276] [2024-06-14 16:01:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670771276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:25,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:01:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616866763] [2024-06-14 16:01:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:25,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:01:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:01:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:01:25,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:01:25,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 145 transitions, 1434 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:01:25,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:25,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:01:25,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:26,835 INFO L124 PetriNetUnfolderBase]: 1605/2487 cut-off events. [2024-06-14 16:01:26,835 INFO L125 PetriNetUnfolderBase]: For 48784/48784 co-relation queries the response was YES. [2024-06-14 16:01:26,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14784 conditions, 2487 events. 1605/2487 cut-off events. For 48784/48784 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12311 event pairs, 396 based on Foata normal form. 2/2487 useless extension candidates. Maximal degree in co-relation 14713. Up to 2430 conditions per place. [2024-06-14 16:01:26,852 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 143 selfloop transitions, 12 changer transitions 0/159 dead transitions. [2024-06-14 16:01:26,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 159 transitions, 1811 flow [2024-06-14 16:01:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:01:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:01:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-14 16:01:26,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 16:01:26,853 INFO L175 Difference]: Start difference. First operand has 135 places, 145 transitions, 1434 flow. Second operand 6 states and 102 transitions. [2024-06-14 16:01:26,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 159 transitions, 1811 flow [2024-06-14 16:01:26,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 159 transitions, 1740 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 16:01:26,906 INFO L231 Difference]: Finished difference. Result has 136 places, 148 transitions, 1424 flow [2024-06-14 16:01:26,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1424, PETRI_PLACES=136, PETRI_TRANSITIONS=148} [2024-06-14 16:01:26,906 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 94 predicate places. [2024-06-14 16:01:26,906 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 148 transitions, 1424 flow [2024-06-14 16:01:26,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:01:26,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:26,907 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:26,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 16:01:26,907 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:01:26,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash 198734042, now seen corresponding path program 3 times [2024-06-14 16:01:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:26,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573042167] [2024-06-14 16:01:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:37,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:37,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573042167] [2024-06-14 16:01:37,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573042167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:37,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:37,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:01:37,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314660105] [2024-06-14 16:01:37,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:37,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:01:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:01:37,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:01:37,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:01:37,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 148 transitions, 1424 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:01:37,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:37,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:01:37,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:38,635 INFO L124 PetriNetUnfolderBase]: 1599/2484 cut-off events. [2024-06-14 16:01:38,635 INFO L125 PetriNetUnfolderBase]: For 50682/50682 co-relation queries the response was YES. [2024-06-14 16:01:38,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14778 conditions, 2484 events. 1599/2484 cut-off events. For 50682/50682 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12268 event pairs, 396 based on Foata normal form. 2/2484 useless extension candidates. Maximal degree in co-relation 14706. Up to 2395 conditions per place. [2024-06-14 16:01:38,652 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 137 selfloop transitions, 24 changer transitions 0/165 dead transitions. [2024-06-14 16:01:38,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 165 transitions, 1816 flow [2024-06-14 16:01:38,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:01:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:01:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-14 16:01:38,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44308943089430897 [2024-06-14 16:01:38,655 INFO L175 Difference]: Start difference. First operand has 136 places, 148 transitions, 1424 flow. Second operand 6 states and 109 transitions. [2024-06-14 16:01:38,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 165 transitions, 1816 flow [2024-06-14 16:01:38,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 165 transitions, 1775 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 16:01:38,708 INFO L231 Difference]: Finished difference. Result has 139 places, 150 transitions, 1472 flow [2024-06-14 16:01:38,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1472, PETRI_PLACES=139, PETRI_TRANSITIONS=150} [2024-06-14 16:01:38,708 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-14 16:01:38,709 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 150 transitions, 1472 flow [2024-06-14 16:01:38,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:01:38,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:38,709 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:38,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 16:01:38,709 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:01:38,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash 198980120, now seen corresponding path program 1 times [2024-06-14 16:01:38,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539097210] [2024-06-14 16:01:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:50,706 INFO 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:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539097210] [2024-06-14 16:01:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539097210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:50,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:50,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:01:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812924225] [2024-06-14 16:01:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:50,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:01:50,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:01:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:01:50,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:01:50,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 150 transitions, 1472 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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:01:50,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:50,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:01:50,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:51,824 INFO L124 PetriNetUnfolderBase]: 1594/2479 cut-off events. [2024-06-14 16:01:51,824 INFO L125 PetriNetUnfolderBase]: For 53309/53309 co-relation queries the response was YES. [2024-06-14 16:01:51,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14910 conditions, 2479 events. 1594/2479 cut-off events. For 53309/53309 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12264 event pairs, 392 based on Foata normal form. 2/2479 useless extension candidates. Maximal degree in co-relation 14837. Up to 2412 conditions per place. [2024-06-14 16:01:51,841 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 146 selfloop transitions, 13 changer transitions 0/163 dead transitions. [2024-06-14 16:01:51,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 163 transitions, 1848 flow [2024-06-14 16:01:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:01:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:01:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-14 16:01:51,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 16:01:51,843 INFO L175 Difference]: Start difference. First operand has 139 places, 150 transitions, 1472 flow. Second operand 6 states and 102 transitions. [2024-06-14 16:01:51,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 163 transitions, 1848 flow [2024-06-14 16:01:51,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 163 transitions, 1805 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 16:01:51,892 INFO L231 Difference]: Finished difference. Result has 141 places, 152 transitions, 1482 flow [2024-06-14 16:01:51,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1482, PETRI_PLACES=141, PETRI_TRANSITIONS=152} [2024-06-14 16:01:51,893 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2024-06-14 16:01:51,893 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 152 transitions, 1482 flow [2024-06-14 16:01:51,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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:01:51,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:51,894 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:01:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 16:01:51,894 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 16:01:51,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2102809513, now seen corresponding path program 1 times [2024-06-14 16:01:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:51,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876653289] [2024-06-14 16:01:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:03,479 INFO 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,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:03,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876653289] [2024-06-14 16:02:03,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876653289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:03,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:03,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658012524] [2024-06-14 16:02:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:03,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:03,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:03,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:02:03,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 152 transitions, 1482 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:03,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:03,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:02:03,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:04,921 INFO L124 PetriNetUnfolderBase]: 1635/2550 cut-off events. [2024-06-14 16:02:04,922 INFO L125 PetriNetUnfolderBase]: For 56360/56360 co-relation queries the response was YES. [2024-06-14 16:02:04,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15309 conditions, 2550 events. 1635/2550 cut-off events. For 56360/56360 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12706 event pairs, 266 based on Foata normal form. 12/2558 useless extension candidates. Maximal degree in co-relation 15236. Up to 2323 conditions per place. [2024-06-14 16:02:04,937 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 164 selfloop transitions, 15 changer transitions 0/183 dead transitions. [2024-06-14 16:02:04,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 183 transitions, 1951 flow [2024-06-14 16:02:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:02:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:02:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-14 16:02:04,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-14 16:02:04,939 INFO L175 Difference]: Start difference. First operand has 141 places, 152 transitions, 1482 flow. Second operand 8 states and 142 transitions. [2024-06-14 16:02:04,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 183 transitions, 1951 flow [2024-06-14 16:02:04,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 183 transitions, 1912 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 16:02:04,992 INFO L231 Difference]: Finished difference. Result has 145 places, 153 transitions, 1505 flow [2024-06-14 16:02:04,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1505, PETRI_PLACES=145, PETRI_TRANSITIONS=153} [2024-06-14 16:02:04,993 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2024-06-14 16:02:04,993 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 153 transitions, 1505 flow [2024-06-14 16:02:04,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:04,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:04,994 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:02:04,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 16:02:04,994 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 16:02:04,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash 865152377, now seen corresponding path program 2 times [2024-06-14 16:02:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:04,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844563874] [2024-06-14 16:02:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:15,267 INFO 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,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844563874] [2024-06-14 16:02:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844563874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:15,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300977511] [2024-06-14 16:02:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:15,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:15,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:15,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:02:15,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 153 transitions, 1505 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:15,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:15,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:02:15,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:16,704 INFO L124 PetriNetUnfolderBase]: 1693/2648 cut-off events. [2024-06-14 16:02:16,704 INFO L125 PetriNetUnfolderBase]: For 60649/60649 co-relation queries the response was YES. [2024-06-14 16:02:16,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15927 conditions, 2648 events. 1693/2648 cut-off events. For 60649/60649 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13395 event pairs, 413 based on Foata normal form. 12/2656 useless extension candidates. Maximal degree in co-relation 15853. Up to 2415 conditions per place. [2024-06-14 16:02:16,724 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 157 selfloop transitions, 25 changer transitions 0/186 dead transitions. [2024-06-14 16:02:16,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 186 transitions, 2007 flow [2024-06-14 16:02:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:02:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:02:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-14 16:02:16,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-14 16:02:16,727 INFO L175 Difference]: Start difference. First operand has 145 places, 153 transitions, 1505 flow. Second operand 8 states and 146 transitions. [2024-06-14 16:02:16,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 186 transitions, 2007 flow [2024-06-14 16:02:16,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 186 transitions, 1965 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 16:02:16,788 INFO L231 Difference]: Finished difference. Result has 148 places, 156 transitions, 1566 flow [2024-06-14 16:02:16,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1566, PETRI_PLACES=148, PETRI_TRANSITIONS=156} [2024-06-14 16:02:16,789 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places. [2024-06-14 16:02:16,789 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 156 transitions, 1566 flow [2024-06-14 16:02:16,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:16,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:16,789 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:02:16,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 16:02:16,790 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 16:02:16,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash 860568407, now seen corresponding path program 3 times [2024-06-14 16:02:16,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:16,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920407768] [2024-06-14 16:02:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:28,855 INFO 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:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920407768] [2024-06-14 16:02:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920407768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:28,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891914575] [2024-06-14 16:02:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:28,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:28,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:29,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:02:29,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 156 transitions, 1566 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:29,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:29,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:02:29,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:30,247 INFO L124 PetriNetUnfolderBase]: 1734/2714 cut-off events. [2024-06-14 16:02:30,247 INFO L125 PetriNetUnfolderBase]: For 65505/65505 co-relation queries the response was YES. [2024-06-14 16:02:30,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16421 conditions, 2714 events. 1734/2714 cut-off events. For 65505/65505 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13821 event pairs, 411 based on Foata normal form. 12/2722 useless extension candidates. Maximal degree in co-relation 16345. Up to 2399 conditions per place. [2024-06-14 16:02:30,264 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 153 selfloop transitions, 31 changer transitions 0/188 dead transitions. [2024-06-14 16:02:30,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 188 transitions, 2062 flow [2024-06-14 16:02:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:02:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:02:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-14 16:02:30,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-14 16:02:30,267 INFO L175 Difference]: Start difference. First operand has 148 places, 156 transitions, 1566 flow. Second operand 8 states and 146 transitions. [2024-06-14 16:02:30,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 188 transitions, 2062 flow [2024-06-14 16:02:30,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 188 transitions, 2001 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 16:02:30,320 INFO L231 Difference]: Finished difference. Result has 151 places, 157 transitions, 1601 flow [2024-06-14 16:02:30,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1601, PETRI_PLACES=151, PETRI_TRANSITIONS=157} [2024-06-14 16:02:30,321 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places. [2024-06-14 16:02:30,321 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 157 transitions, 1601 flow [2024-06-14 16:02:30,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:30,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:30,321 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:02:30,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 16:02:30,322 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 16:02:30,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1775259097, now seen corresponding path program 4 times [2024-06-14 16:02:30,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:30,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43929221] [2024-06-14 16:02:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:40,340 INFO 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:40,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:40,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43929221] [2024-06-14 16:02:40,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43929221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:40,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:40,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:40,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666512221] [2024-06-14 16:02:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:40,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:40,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:40,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:40,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:40,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:02:40,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 157 transitions, 1601 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:40,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:40,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:02:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:41,905 INFO L124 PetriNetUnfolderBase]: 1803/2835 cut-off events. [2024-06-14 16:02:41,906 INFO L125 PetriNetUnfolderBase]: For 70333/70336 co-relation queries the response was YES. [2024-06-14 16:02:41,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17182 conditions, 2835 events. 1803/2835 cut-off events. For 70333/70336 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14652 event pairs, 437 based on Foata normal form. 14/2846 useless extension candidates. Maximal degree in co-relation 17105. Up to 2606 conditions per place. [2024-06-14 16:02:41,923 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 167 selfloop transitions, 25 changer transitions 0/196 dead transitions. [2024-06-14 16:02:41,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 196 transitions, 2191 flow [2024-06-14 16:02:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:02:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:02:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-14 16:02:41,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-14 16:02:41,926 INFO L175 Difference]: Start difference. First operand has 151 places, 157 transitions, 1601 flow. Second operand 9 states and 160 transitions. [2024-06-14 16:02:41,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 196 transitions, 2191 flow [2024-06-14 16:02:41,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 196 transitions, 2103 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 16:02:41,985 INFO L231 Difference]: Finished difference. Result has 155 places, 163 transitions, 1678 flow [2024-06-14 16:02:41,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1678, PETRI_PLACES=155, PETRI_TRANSITIONS=163} [2024-06-14 16:02:41,986 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2024-06-14 16:02:41,986 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 163 transitions, 1678 flow [2024-06-14 16:02:41,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:41,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:41,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:41,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 16:02:41,986 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 16:02:41,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1609025317, now seen corresponding path program 5 times [2024-06-14 16:02:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723399556] [2024-06-14 16:02:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:41,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:53,152 INFO 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:53,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723399556] [2024-06-14 16:02:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723399556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:53,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 16:02:53,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823282143] [2024-06-14 16:02:53,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:53,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 16:02:53,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:53,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 16:02:53,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 16:02:53,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:02:53,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 163 transitions, 1678 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:53,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:53,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:02:53,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:54,702 INFO L124 PetriNetUnfolderBase]: 1783/2801 cut-off events. [2024-06-14 16:02:54,702 INFO L125 PetriNetUnfolderBase]: For 69995/69995 co-relation queries the response was YES. [2024-06-14 16:02:54,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16740 conditions, 2801 events. 1783/2801 cut-off events. For 69995/69995 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14376 event pairs, 429 based on Foata normal form. 12/2809 useless extension candidates. Maximal degree in co-relation 16661. Up to 2541 conditions per place. [2024-06-14 16:02:54,724 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 159 selfloop transitions, 33 changer transitions 0/196 dead transitions. [2024-06-14 16:02:54,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 196 transitions, 2126 flow [2024-06-14 16:02:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:02:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:02:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 16:02:54,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-14 16:02:54,727 INFO L175 Difference]: Start difference. First operand has 155 places, 163 transitions, 1678 flow. Second operand 9 states and 161 transitions. [2024-06-14 16:02:54,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 196 transitions, 2126 flow [2024-06-14 16:02:54,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 196 transitions, 2045 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 16:02:54,797 INFO L231 Difference]: Finished difference. Result has 157 places, 162 transitions, 1621 flow [2024-06-14 16:02:54,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1621, PETRI_PLACES=157, PETRI_TRANSITIONS=162} [2024-06-14 16:02:54,798 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 115 predicate places. [2024-06-14 16:02:54,798 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 162 transitions, 1621 flow [2024-06-14 16:02:54,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:54,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:54,798 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:02:54,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 16:02:54,798 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:02:54,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 452227369, now seen corresponding path program 1 times [2024-06-14 16:02:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336979684] [2024-06-14 16:02:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:06,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336979684] [2024-06-14 16:03:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336979684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:06,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:06,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409032758] [2024-06-14 16:03:06,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:06,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:06,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:03:06,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 162 transitions, 1621 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:06,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:06,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:03:06,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:07,741 INFO L124 PetriNetUnfolderBase]: 1722/2735 cut-off events. [2024-06-14 16:03:07,741 INFO L125 PetriNetUnfolderBase]: For 69898/69901 co-relation queries the response was YES. [2024-06-14 16:03:07,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16379 conditions, 2735 events. 1722/2735 cut-off events. For 69898/69901 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14281 event pairs, 428 based on Foata normal form. 2/2735 useless extension candidates. Maximal degree in co-relation 16301. Up to 2509 conditions per place. [2024-06-14 16:03:07,759 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 145 selfloop transitions, 41 changer transitions 0/200 dead transitions. [2024-06-14 16:03:07,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 200 transitions, 2271 flow [2024-06-14 16:03:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-14 16:03:07,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-14 16:03:07,760 INFO L175 Difference]: Start difference. First operand has 157 places, 162 transitions, 1621 flow. Second operand 8 states and 146 transitions. [2024-06-14 16:03:07,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 200 transitions, 2271 flow [2024-06-14 16:03:07,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 200 transitions, 2103 flow, removed 15 selfloop flow, removed 12 redundant places. [2024-06-14 16:03:07,830 INFO L231 Difference]: Finished difference. Result has 155 places, 180 transitions, 1764 flow [2024-06-14 16:03:07,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1764, PETRI_PLACES=155, PETRI_TRANSITIONS=180} [2024-06-14 16:03:07,830 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2024-06-14 16:03:07,830 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 180 transitions, 1764 flow [2024-06-14 16:03:07,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:07,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:07,831 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:03:07,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 16:03:07,831 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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:07,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1578347496, now seen corresponding path program 1 times [2024-06-14 16:03:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:07,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039618833] [2024-06-14 16:03:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:19,127 INFO 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:19,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039618833] [2024-06-14 16:03:19,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039618833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:19,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:19,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597650339] [2024-06-14 16:03:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:19,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:19,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:19,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:19,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:03:19,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 180 transitions, 1764 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:19,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:19,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:03:19,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:20,332 INFO L124 PetriNetUnfolderBase]: 1811/2840 cut-off events. [2024-06-14 16:03:20,332 INFO L125 PetriNetUnfolderBase]: For 74608/74608 co-relation queries the response was YES. [2024-06-14 16:03:20,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17051 conditions, 2840 events. 1811/2840 cut-off events. For 74608/74608 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14600 event pairs, 428 based on Foata normal form. 2/2840 useless extension candidates. Maximal degree in co-relation 16975. Up to 2702 conditions per place. [2024-06-14 16:03:20,355 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 178 selfloop transitions, 35 changer transitions 0/217 dead transitions. [2024-06-14 16:03:20,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 217 transitions, 2475 flow [2024-06-14 16:03:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 16:03:20,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-14 16:03:20,358 INFO L175 Difference]: Start difference. First operand has 155 places, 180 transitions, 1764 flow. Second operand 8 states and 141 transitions. [2024-06-14 16:03:20,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 217 transitions, 2475 flow [2024-06-14 16:03:20,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 217 transitions, 2403 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-06-14 16:03:20,449 INFO L231 Difference]: Finished difference. Result has 163 places, 193 transitions, 1939 flow [2024-06-14 16:03:20,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1939, PETRI_PLACES=163, PETRI_TRANSITIONS=193} [2024-06-14 16:03:20,449 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2024-06-14 16:03:20,450 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 193 transitions, 1939 flow [2024-06-14 16:03:20,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:20,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:20,450 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:03:20,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 16:03:20,450 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:03:20,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:20,451 INFO L85 PathProgramCache]: Analyzing trace with hash 452317579, now seen corresponding path program 2 times [2024-06-14 16:03:20,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:20,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027175107] [2024-06-14 16:03:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:20,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:32,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027175107] [2024-06-14 16:03:32,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027175107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:32,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:32,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:32,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245355456] [2024-06-14 16:03:32,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:32,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:32,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:32,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:32,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:03:32,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 193 transitions, 1939 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:32,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:32,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:03:32,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:33,220 INFO L124 PetriNetUnfolderBase]: 1762/2784 cut-off events. [2024-06-14 16:03:33,221 INFO L125 PetriNetUnfolderBase]: For 79309/79312 co-relation queries the response was YES. [2024-06-14 16:03:33,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17044 conditions, 2784 events. 1762/2784 cut-off events. For 79309/79312 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14498 event pairs, 432 based on Foata normal form. 2/2784 useless extension candidates. Maximal degree in co-relation 16964. Up to 2574 conditions per place. [2024-06-14 16:03:33,238 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 153 selfloop transitions, 43 changer transitions 0/213 dead transitions. [2024-06-14 16:03:33,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 213 transitions, 2416 flow [2024-06-14 16:03:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 16:03:33,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-14 16:03:33,240 INFO L175 Difference]: Start difference. First operand has 163 places, 193 transitions, 1939 flow. Second operand 8 states and 141 transitions. [2024-06-14 16:03:33,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 213 transitions, 2416 flow [2024-06-14 16:03:33,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 213 transitions, 2344 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-14 16:03:33,325 INFO L231 Difference]: Finished difference. Result has 168 places, 197 transitions, 2011 flow [2024-06-14 16:03:33,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2011, PETRI_PLACES=168, PETRI_TRANSITIONS=197} [2024-06-14 16:03:33,325 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 126 predicate places. [2024-06-14 16:03:33,325 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 197 transitions, 2011 flow [2024-06-14 16:03:33,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:33,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:33,326 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:03:33,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 16:03:33,326 INFO L420 AbstractCegarLoop]: === Iteration 38 === 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:33,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1582072146, now seen corresponding path program 2 times [2024-06-14 16:03:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130380626] [2024-06-14 16:03:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130380626] [2024-06-14 16:03:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130380626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065428892] [2024-06-14 16:03:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:44,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:44,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:44,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:03:44,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 197 transitions, 2011 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:44,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:44,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:03:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:46,210 INFO L124 PetriNetUnfolderBase]: 1847/2890 cut-off events. [2024-06-14 16:03:46,210 INFO L125 PetriNetUnfolderBase]: For 85331/85331 co-relation queries the response was YES. [2024-06-14 16:03:46,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17962 conditions, 2890 events. 1847/2890 cut-off events. For 85331/85331 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14877 event pairs, 430 based on Foata normal form. 2/2890 useless extension candidates. Maximal degree in co-relation 17880. Up to 2779 conditions per place. [2024-06-14 16:03:46,231 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 190 selfloop transitions, 33 changer transitions 0/227 dead transitions. [2024-06-14 16:03:46,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 227 transitions, 2673 flow [2024-06-14 16:03:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:03:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:03:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-14 16:03:46,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3975609756097561 [2024-06-14 16:03:46,233 INFO L175 Difference]: Start difference. First operand has 168 places, 197 transitions, 2011 flow. Second operand 10 states and 163 transitions. [2024-06-14 16:03:46,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 227 transitions, 2673 flow [2024-06-14 16:03:46,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 227 transitions, 2566 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-14 16:03:46,337 INFO L231 Difference]: Finished difference. Result has 174 places, 205 transitions, 2067 flow [2024-06-14 16:03:46,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2067, PETRI_PLACES=174, PETRI_TRANSITIONS=205} [2024-06-14 16:03:46,338 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 132 predicate places. [2024-06-14 16:03:46,338 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 205 transitions, 2067 flow [2024-06-14 16:03:46,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:46,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:46,338 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:03:46,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 16:03:46,339 INFO L420 AbstractCegarLoop]: === Iteration 39 === 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:46,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash 456036649, now seen corresponding path program 3 times [2024-06-14 16:03:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617152583] [2024-06-14 16:03:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:58,458 INFO 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,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617152583] [2024-06-14 16:03:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617152583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:58,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164351295] [2024-06-14 16:03:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:58,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:58,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:58,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:58,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:58,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:03:58,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 205 transitions, 2067 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:58,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:58,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:03:58,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:59,807 INFO L124 PetriNetUnfolderBase]: 1800/2842 cut-off events. [2024-06-14 16:03:59,807 INFO L125 PetriNetUnfolderBase]: For 90136/90139 co-relation queries the response was YES. [2024-06-14 16:03:59,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17739 conditions, 2842 events. 1800/2842 cut-off events. For 90136/90139 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14833 event pairs, 433 based on Foata normal form. 3/2843 useless extension candidates. Maximal degree in co-relation 17655. Up to 2623 conditions per place. [2024-06-14 16:03:59,833 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 161 selfloop transitions, 45 changer transitions 0/226 dead transitions. [2024-06-14 16:03:59,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 226 transitions, 2619 flow [2024-06-14 16:03:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 16:03:59,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-14 16:03:59,834 INFO L175 Difference]: Start difference. First operand has 174 places, 205 transitions, 2067 flow. Second operand 8 states and 141 transitions. [2024-06-14 16:03:59,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 226 transitions, 2619 flow [2024-06-14 16:03:59,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 226 transitions, 2569 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 16:03:59,934 INFO L231 Difference]: Finished difference. Result has 177 places, 211 transitions, 2224 flow [2024-06-14 16:03:59,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2017, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2224, PETRI_PLACES=177, PETRI_TRANSITIONS=211} [2024-06-14 16:03:59,935 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-14 16:03:59,935 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 211 transitions, 2224 flow [2024-06-14 16:03:59,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:59,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:59,935 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:03:59,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 16:03:59,936 INFO L420 AbstractCegarLoop]: === Iteration 40 === 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:59,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 456036804, now seen corresponding path program 3 times [2024-06-14 16:03:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:59,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929032963] [2024-06-14 16:03:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:11,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:04:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929032963] [2024-06-14 16:04:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929032963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:04:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477839910] [2024-06-14 16:04:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:11,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:04:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:04:11,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:04:11,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:04:11,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 211 transitions, 2224 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:11,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:11,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:04:11,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:12,497 INFO L124 PetriNetUnfolderBase]: 1856/2903 cut-off events. [2024-06-14 16:04:12,498 INFO L125 PetriNetUnfolderBase]: For 94609/94609 co-relation queries the response was YES. [2024-06-14 16:04:12,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18667 conditions, 2903 events. 1856/2903 cut-off events. For 94609/94609 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14972 event pairs, 429 based on Foata normal form. 2/2903 useless extension candidates. Maximal degree in co-relation 18581. Up to 2795 conditions per place. [2024-06-14 16:04:12,516 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 194 selfloop transitions, 32 changer transitions 0/230 dead transitions. [2024-06-14 16:04:12,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 230 transitions, 2739 flow [2024-06-14 16:04:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-14 16:04:12,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-14 16:04:12,517 INFO L175 Difference]: Start difference. First operand has 177 places, 211 transitions, 2224 flow. Second operand 8 states and 138 transitions. [2024-06-14 16:04:12,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 230 transitions, 2739 flow [2024-06-14 16:04:12,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 230 transitions, 2572 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-14 16:04:12,635 INFO L231 Difference]: Finished difference. Result has 179 places, 211 transitions, 2127 flow [2024-06-14 16:04:12,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2127, PETRI_PLACES=179, PETRI_TRANSITIONS=211} [2024-06-14 16:04:12,636 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places. [2024-06-14 16:04:12,636 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 211 transitions, 2127 flow [2024-06-14 16:04:12,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:12,637 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:04:12,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 16:04:12,637 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:04:12,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1873140950, now seen corresponding path program 4 times [2024-06-14 16:04:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483918167] [2024-06-14 16:04:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483918167] [2024-06-14 16:04:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483918167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:24,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:24,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:04:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374260444] [2024-06-14 16:04:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:24,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:04:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:24,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:04:24,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:04:24,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:04:24,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 211 transitions, 2127 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:24,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:24,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:04:24,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:25,495 INFO L124 PetriNetUnfolderBase]: 1866/2915 cut-off events. [2024-06-14 16:04:25,495 INFO L125 PetriNetUnfolderBase]: For 98835/98835 co-relation queries the response was YES. [2024-06-14 16:04:25,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18767 conditions, 2915 events. 1866/2915 cut-off events. For 98835/98835 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14963 event pairs, 432 based on Foata normal form. 2/2915 useless extension candidates. Maximal degree in co-relation 18680. Up to 2845 conditions per place. [2024-06-14 16:04:25,517 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 208 selfloop transitions, 15 changer transitions 0/227 dead transitions. [2024-06-14 16:04:25,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 227 transitions, 2655 flow [2024-06-14 16:04:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:04:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:04:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-14 16:04:25,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40069686411149824 [2024-06-14 16:04:25,519 INFO L175 Difference]: Start difference. First operand has 179 places, 211 transitions, 2127 flow. Second operand 7 states and 115 transitions. [2024-06-14 16:04:25,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 227 transitions, 2655 flow [2024-06-14 16:04:25,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 227 transitions, 2604 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-14 16:04:25,625 INFO L231 Difference]: Finished difference. Result has 180 places, 214 transitions, 2155 flow [2024-06-14 16:04:25,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2155, PETRI_PLACES=180, PETRI_TRANSITIONS=214} [2024-06-14 16:04:25,626 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2024-06-14 16:04:25,626 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 214 transitions, 2155 flow [2024-06-14 16:04:25,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:25,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:25,626 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:04:25,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 16:04:25,626 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:04:25,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1873408077, now seen corresponding path program 1 times [2024-06-14 16:04:25,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120984648] [2024-06-14 16:04:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:25,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:36,159 INFO 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:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:36,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120984648] [2024-06-14 16:04:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120984648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:36,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:36,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:04:36,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984764164] [2024-06-14 16:04:36,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:36,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:04:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:36,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:04:36,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:04:36,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:04:36,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 214 transitions, 2155 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:36,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:04:36,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:37,366 INFO L124 PetriNetUnfolderBase]: 1863/2913 cut-off events. [2024-06-14 16:04:37,367 INFO L125 PetriNetUnfolderBase]: For 103277/103277 co-relation queries the response was YES. [2024-06-14 16:04:37,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18829 conditions, 2913 events. 1863/2913 cut-off events. For 103277/103277 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15086 event pairs, 429 based on Foata normal form. 1/2912 useless extension candidates. Maximal degree in co-relation 18741. Up to 2843 conditions per place. [2024-06-14 16:04:37,390 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 207 selfloop transitions, 17 changer transitions 0/228 dead transitions. [2024-06-14 16:04:37,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 228 transitions, 2672 flow [2024-06-14 16:04:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:04:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:04:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-14 16:04:37,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 16:04:37,391 INFO L175 Difference]: Start difference. First operand has 180 places, 214 transitions, 2155 flow. Second operand 6 states and 102 transitions. [2024-06-14 16:04:37,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 228 transitions, 2672 flow [2024-06-14 16:04:37,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 228 transitions, 2624 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-14 16:04:37,512 INFO L231 Difference]: Finished difference. Result has 181 places, 217 transitions, 2187 flow [2024-06-14 16:04:37,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2187, PETRI_PLACES=181, PETRI_TRANSITIONS=217} [2024-06-14 16:04:37,512 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places. [2024-06-14 16:04:37,513 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 217 transitions, 2187 flow [2024-06-14 16:04:37,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:37,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:37,513 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:04:37,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 16:04:37,514 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:04:37,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:37,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1865783565, now seen corresponding path program 4 times [2024-06-14 16:04:37,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:37,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104926634] [2024-06-14 16:04:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:37,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:49,330 INFO 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:49,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104926634] [2024-06-14 16:04:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104926634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:49,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:04:49,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405269282] [2024-06-14 16:04:49,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:49,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:04:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:49,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:04:49,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:04:49,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:04:49,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 217 transitions, 2187 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:49,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:49,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:04:49,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:50,599 INFO L124 PetriNetUnfolderBase]: 1804/2845 cut-off events. [2024-06-14 16:04:50,600 INFO L125 PetriNetUnfolderBase]: For 108070/108073 co-relation queries the response was YES. [2024-06-14 16:04:50,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18579 conditions, 2845 events. 1804/2845 cut-off events. For 108070/108073 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14941 event pairs, 440 based on Foata normal form. 4/2844 useless extension candidates. Maximal degree in co-relation 18490. Up to 2527 conditions per place. [2024-06-14 16:04:50,621 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 155 selfloop transitions, 70 changer transitions 0/247 dead transitions. [2024-06-14 16:04:50,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 247 transitions, 2837 flow [2024-06-14 16:04:50,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:04:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:04:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-14 16:04:50,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738675958188153 [2024-06-14 16:04:50,624 INFO L175 Difference]: Start difference. First operand has 181 places, 217 transitions, 2187 flow. Second operand 7 states and 136 transitions. [2024-06-14 16:04:50,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 247 transitions, 2837 flow [2024-06-14 16:04:50,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 247 transitions, 2779 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-14 16:04:50,731 INFO L231 Difference]: Finished difference. Result has 186 places, 226 transitions, 2503 flow [2024-06-14 16:04:50,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2503, PETRI_PLACES=186, PETRI_TRANSITIONS=226} [2024-06-14 16:04:50,732 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places. [2024-06-14 16:04:50,733 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 226 transitions, 2503 flow [2024-06-14 16:04:50,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:50,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:50,733 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:04:50,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 16:04:50,733 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:04:50,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1865783720, now seen corresponding path program 5 times [2024-06-14 16:04:50,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:50,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994865205] [2024-06-14 16:04:50,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:50,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:01,472 INFO 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:01,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:01,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994865205] [2024-06-14 16:05:01,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994865205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:01,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:01,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112798143] [2024-06-14 16:05:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:01,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:01,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:01,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:05:01,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 226 transitions, 2503 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:01,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:05:01,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:02,814 INFO L124 PetriNetUnfolderBase]: 1882/2940 cut-off events. [2024-06-14 16:05:02,814 INFO L125 PetriNetUnfolderBase]: For 118986/118986 co-relation queries the response was YES. [2024-06-14 16:05:02,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20243 conditions, 2940 events. 1882/2940 cut-off events. For 118986/118986 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15154 event pairs, 429 based on Foata normal form. 2/2940 useless extension candidates. Maximal degree in co-relation 20151. Up to 2821 conditions per place. [2024-06-14 16:05:02,843 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 216 selfloop transitions, 31 changer transitions 0/251 dead transitions. [2024-06-14 16:05:02,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 251 transitions, 3200 flow [2024-06-14 16:05:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:05:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:05:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-14 16:05:02,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-14 16:05:02,845 INFO L175 Difference]: Start difference. First operand has 186 places, 226 transitions, 2503 flow. Second operand 7 states and 128 transitions. [2024-06-14 16:05:02,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 251 transitions, 3200 flow [2024-06-14 16:05:03,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 251 transitions, 3071 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-06-14 16:05:03,009 INFO L231 Difference]: Finished difference. Result has 191 places, 230 transitions, 2514 flow [2024-06-14 16:05:03,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2514, PETRI_PLACES=191, PETRI_TRANSITIONS=230} [2024-06-14 16:05:03,010 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2024-06-14 16:05:03,010 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 230 transitions, 2514 flow [2024-06-14 16:05:03,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:03,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:03,011 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:05:03,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 16:05:03,012 INFO L420 AbstractCegarLoop]: === Iteration 45 === 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:03,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1865789300, now seen corresponding path program 6 times [2024-06-14 16:05:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:03,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107197831] [2024-06-14 16:05:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:14,112 INFO 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:14,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107197831] [2024-06-14 16:05:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107197831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:14,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:14,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259948205] [2024-06-14 16:05:14,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:14,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:14,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:14,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:05:14,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 230 transitions, 2514 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:14,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:14,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:05:14,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:15,416 INFO L124 PetriNetUnfolderBase]: 1876/2930 cut-off events. [2024-06-14 16:05:15,416 INFO L125 PetriNetUnfolderBase]: For 116908/116908 co-relation queries the response was YES. [2024-06-14 16:05:15,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20119 conditions, 2930 events. 1876/2930 cut-off events. For 116908/116908 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15063 event pairs, 433 based on Foata normal form. 2/2930 useless extension candidates. Maximal degree in co-relation 20025. Up to 2816 conditions per place. [2024-06-14 16:05:15,437 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 214 selfloop transitions, 30 changer transitions 0/248 dead transitions. [2024-06-14 16:05:15,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 248 transitions, 3073 flow [2024-06-14 16:05:15,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:05:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:05:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-14 16:05:15,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-14 16:05:15,438 INFO L175 Difference]: Start difference. First operand has 191 places, 230 transitions, 2514 flow. Second operand 7 states and 124 transitions. [2024-06-14 16:05:15,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 248 transitions, 3073 flow [2024-06-14 16:05:15,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 248 transitions, 2927 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-14 16:05:15,583 INFO L231 Difference]: Finished difference. Result has 192 places, 231 transitions, 2448 flow [2024-06-14 16:05:15,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2374, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2448, PETRI_PLACES=192, PETRI_TRANSITIONS=231} [2024-06-14 16:05:15,584 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2024-06-14 16:05:15,584 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 231 transitions, 2448 flow [2024-06-14 16:05:15,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:15,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:15,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:15,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 16:05:15,585 INFO L420 AbstractCegarLoop]: === Iteration 46 === 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:15,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1274755267, now seen corresponding path program 1 times [2024-06-14 16:05:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:15,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348773863] [2024-06-14 16:05:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:15,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:26,750 INFO 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:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348773863] [2024-06-14 16:05:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348773863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:26,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366702669] [2024-06-14 16:05:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:26,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:26,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:26,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:05:26,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 231 transitions, 2448 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:26,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:26,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:05:26,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:28,104 INFO L124 PetriNetUnfolderBase]: 1970/3075 cut-off events. [2024-06-14 16:05:28,105 INFO L125 PetriNetUnfolderBase]: For 128661/128664 co-relation queries the response was YES. [2024-06-14 16:05:28,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21163 conditions, 3075 events. 1970/3075 cut-off events. For 128661/128664 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15950 event pairs, 442 based on Foata normal form. 6/3078 useless extension candidates. Maximal degree in co-relation 21069. Up to 2876 conditions per place. [2024-06-14 16:05:28,130 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 220 selfloop transitions, 52 changer transitions 0/276 dead transitions. [2024-06-14 16:05:28,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 276 transitions, 3500 flow [2024-06-14 16:05:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:05:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:05:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-14 16:05:28,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-14 16:05:28,133 INFO L175 Difference]: Start difference. First operand has 192 places, 231 transitions, 2448 flow. Second operand 8 states and 142 transitions. [2024-06-14 16:05:28,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 276 transitions, 3500 flow [2024-06-14 16:05:28,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 276 transitions, 3458 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 16:05:28,316 INFO L231 Difference]: Finished difference. Result has 200 places, 253 transitions, 2919 flow [2024-06-14 16:05:28,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2919, PETRI_PLACES=200, PETRI_TRANSITIONS=253} [2024-06-14 16:05:28,316 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 158 predicate places. [2024-06-14 16:05:28,317 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 253 transitions, 2919 flow [2024-06-14 16:05:28,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:28,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:28,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:28,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 16:05:28,317 INFO L420 AbstractCegarLoop]: === Iteration 47 === 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:28,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash 643475927, now seen corresponding path program 2 times [2024-06-14 16:05:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:28,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041252690] [2024-06-14 16:05:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:38,812 INFO 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:38,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:38,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041252690] [2024-06-14 16:05:38,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041252690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:38,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:38,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260277521] [2024-06-14 16:05:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:38,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:38,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:38,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:39,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:05:39,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 253 transitions, 2919 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:39,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:39,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:05:39,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:40,170 INFO L124 PetriNetUnfolderBase]: 1990/3109 cut-off events. [2024-06-14 16:05:40,170 INFO L125 PetriNetUnfolderBase]: For 137153/137156 co-relation queries the response was YES. [2024-06-14 16:05:40,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22213 conditions, 3109 events. 1990/3109 cut-off events. For 137153/137156 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16217 event pairs, 448 based on Foata normal form. 6/3112 useless extension candidates. Maximal degree in co-relation 22115. Up to 2991 conditions per place. [2024-06-14 16:05:40,198 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 239 selfloop transitions, 23 changer transitions 0/266 dead transitions. [2024-06-14 16:05:40,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 266 transitions, 3536 flow [2024-06-14 16:05:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:05:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:05:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-14 16:05:40,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-14 16:05:40,200 INFO L175 Difference]: Start difference. First operand has 200 places, 253 transitions, 2919 flow. Second operand 6 states and 105 transitions. [2024-06-14 16:05:40,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 266 transitions, 3536 flow [2024-06-14 16:05:40,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 266 transitions, 3468 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-14 16:05:40,417 INFO L231 Difference]: Finished difference. Result has 204 places, 256 transitions, 2970 flow [2024-06-14 16:05:40,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2851, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2970, PETRI_PLACES=204, PETRI_TRANSITIONS=256} [2024-06-14 16:05:40,417 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places. [2024-06-14 16:05:40,417 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 256 transitions, 2970 flow [2024-06-14 16:05:40,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:40,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:40,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:40,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 16:05:40,418 INFO L420 AbstractCegarLoop]: === Iteration 48 === 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:40,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash 643238777, now seen corresponding path program 3 times [2024-06-14 16:05:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:40,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927524942] [2024-06-14 16:05:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:05:51,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:51,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927524942] [2024-06-14 16:05:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927524942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:51,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:51,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006216037] [2024-06-14 16:05:51,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:51,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:51,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:51,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:05:51,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 256 transitions, 2970 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:51,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:51,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:05:51,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:52,668 INFO L124 PetriNetUnfolderBase]: 1978/3089 cut-off events. [2024-06-14 16:05:52,668 INFO L125 PetriNetUnfolderBase]: For 139065/139068 co-relation queries the response was YES. [2024-06-14 16:05:52,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22049 conditions, 3089 events. 1978/3089 cut-off events. For 139065/139068 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16088 event pairs, 438 based on Foata normal form. 6/3092 useless extension candidates. Maximal degree in co-relation 21949. Up to 2884 conditions per place. [2024-06-14 16:05:52,691 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 217 selfloop transitions, 55 changer transitions 0/276 dead transitions. [2024-06-14 16:05:52,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 276 transitions, 3621 flow [2024-06-14 16:05:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:05:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:05:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-14 16:05:52,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 16:05:52,694 INFO L175 Difference]: Start difference. First operand has 204 places, 256 transitions, 2970 flow. Second operand 7 states and 126 transitions. [2024-06-14 16:05:52,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 276 transitions, 3621 flow [2024-06-14 16:05:52,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 276 transitions, 3527 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-14 16:05:52,869 INFO L231 Difference]: Finished difference. Result has 208 places, 258 transitions, 3071 flow [2024-06-14 16:05:52,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2876, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3071, PETRI_PLACES=208, PETRI_TRANSITIONS=258} [2024-06-14 16:05:52,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places. [2024-06-14 16:05:52,870 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 258 transitions, 3071 flow [2024-06-14 16:05:52,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:52,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:52,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:52,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 16:05:52,871 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:05:52,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 643484855, now seen corresponding path program 1 times [2024-06-14 16:05:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473520847] [2024-06-14 16:05:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:06,417 INFO 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:06,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:06,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473520847] [2024-06-14 16:06:06,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473520847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:06,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:06,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:06,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017884432] [2024-06-14 16:06:06,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:06,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:06,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:06,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:06,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:06:06,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 258 transitions, 3071 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:06,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:06,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:06:06,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:07,900 INFO L124 PetriNetUnfolderBase]: 2022/3159 cut-off events. [2024-06-14 16:06:07,900 INFO L125 PetriNetUnfolderBase]: For 153162/153162 co-relation queries the response was YES. [2024-06-14 16:06:07,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22674 conditions, 3159 events. 2022/3159 cut-off events. For 153162/153162 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 16548 event pairs, 463 based on Foata normal form. 12/3167 useless extension candidates. Maximal degree in co-relation 22572. Up to 2969 conditions per place. [2024-06-14 16:06:07,923 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 247 selfloop transitions, 25 changer transitions 0/276 dead transitions. [2024-06-14 16:06:07,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 276 transitions, 3729 flow [2024-06-14 16:06:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:06:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:06:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-14 16:06:07,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-14 16:06:07,925 INFO L175 Difference]: Start difference. First operand has 208 places, 258 transitions, 3071 flow. Second operand 6 states and 110 transitions. [2024-06-14 16:06:07,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 276 transitions, 3729 flow [2024-06-14 16:06:08,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 276 transitions, 3626 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 16:06:08,104 INFO L231 Difference]: Finished difference. Result has 208 places, 259 transitions, 3042 flow [2024-06-14 16:06:08,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3042, PETRI_PLACES=208, PETRI_TRANSITIONS=259} [2024-06-14 16:06:08,105 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places. [2024-06-14 16:06:08,105 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 259 transitions, 3042 flow [2024-06-14 16:06:08,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:08,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:08,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:08,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 16:06:08,105 INFO L420 AbstractCegarLoop]: === Iteration 50 === 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:08,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash 897726655, now seen corresponding path program 4 times [2024-06-14 16:06:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384485512] [2024-06-14 16:06:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:19,292 INFO 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:19,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:19,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384485512] [2024-06-14 16:06:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384485512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104951262] [2024-06-14 16:06:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:19,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:19,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:19,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:06:19,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 259 transitions, 3042 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:19,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:19,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:06:19,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:20,726 INFO L124 PetriNetUnfolderBase]: 2084/3253 cut-off events. [2024-06-14 16:06:20,726 INFO L125 PetriNetUnfolderBase]: For 144883/144886 co-relation queries the response was YES. [2024-06-14 16:06:20,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23244 conditions, 3253 events. 2084/3253 cut-off events. For 144883/144886 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 17112 event pairs, 466 based on Foata normal form. 6/3256 useless extension candidates. Maximal degree in co-relation 23143. Up to 3026 conditions per place. [2024-06-14 16:06:20,753 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 234 selfloop transitions, 57 changer transitions 0/295 dead transitions. [2024-06-14 16:06:20,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 295 transitions, 3979 flow [2024-06-14 16:06:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:06:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:06:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 16:06:20,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4254742547425474 [2024-06-14 16:06:20,756 INFO L175 Difference]: Start difference. First operand has 208 places, 259 transitions, 3042 flow. Second operand 9 states and 157 transitions. [2024-06-14 16:06:20,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 295 transitions, 3979 flow [2024-06-14 16:06:20,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 295 transitions, 3933 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-14 16:06:20,953 INFO L231 Difference]: Finished difference. Result has 213 places, 270 transitions, 3291 flow [2024-06-14 16:06:20,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2996, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3291, PETRI_PLACES=213, PETRI_TRANSITIONS=270} [2024-06-14 16:06:20,954 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 171 predicate places. [2024-06-14 16:06:20,954 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 270 transitions, 3291 flow [2024-06-14 16:06:20,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:20,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:20,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:20,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 16:06:20,955 INFO L420 AbstractCegarLoop]: === Iteration 51 === 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:20,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1251989695, now seen corresponding path program 5 times [2024-06-14 16:06:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:20,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014093230] [2024-06-14 16:06:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:32,478 INFO 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:32,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:32,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014093230] [2024-06-14 16:06:32,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014093230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:32,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:32,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:32,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671947283] [2024-06-14 16:06:32,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:32,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:32,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:32,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:32,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:06:32,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 270 transitions, 3291 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:32,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:32,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:06:32,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:33,903 INFO L124 PetriNetUnfolderBase]: 2104/3289 cut-off events. [2024-06-14 16:06:33,903 INFO L125 PetriNetUnfolderBase]: For 153033/153036 co-relation queries the response was YES. [2024-06-14 16:06:33,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23937 conditions, 3289 events. 2104/3289 cut-off events. For 153033/153036 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17342 event pairs, 466 based on Foata normal form. 6/3292 useless extension candidates. Maximal degree in co-relation 23835. Up to 3082 conditions per place. [2024-06-14 16:06:33,930 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 230 selfloop transitions, 56 changer transitions 0/290 dead transitions. [2024-06-14 16:06:33,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 290 transitions, 3985 flow [2024-06-14 16:06:33,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:06:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:06:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-14 16:06:33,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-14 16:06:33,932 INFO L175 Difference]: Start difference. First operand has 213 places, 270 transitions, 3291 flow. Second operand 8 states and 138 transitions. [2024-06-14 16:06:33,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 290 transitions, 3985 flow [2024-06-14 16:06:34,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 290 transitions, 3746 flow, removed 61 selfloop flow, removed 6 redundant places. [2024-06-14 16:06:34,169 INFO L231 Difference]: Finished difference. Result has 215 places, 273 transitions, 3237 flow [2024-06-14 16:06:34,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3068, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3237, PETRI_PLACES=215, PETRI_TRANSITIONS=273} [2024-06-14 16:06:34,170 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2024-06-14 16:06:34,170 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 273 transitions, 3237 flow [2024-06-14 16:06:34,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:34,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:34,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:34,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 16:06:34,170 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:06:34,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash 176800725, now seen corresponding path program 6 times [2024-06-14 16:06:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955023289] [2024-06-14 16:06:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:45,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:06:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955023289] [2024-06-14 16:06:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955023289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872362595] [2024-06-14 16:06:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:45,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:45,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:06:45,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 273 transitions, 3237 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:45,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:45,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:06:45,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:46,933 INFO L124 PetriNetUnfolderBase]: 2148/3352 cut-off events. [2024-06-14 16:06:46,933 INFO L125 PetriNetUnfolderBase]: For 161677/161680 co-relation queries the response was YES. [2024-06-14 16:06:46,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24391 conditions, 3352 events. 2148/3352 cut-off events. For 161677/161680 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17735 event pairs, 465 based on Foata normal form. 6/3355 useless extension candidates. Maximal degree in co-relation 24290. Up to 2984 conditions per place. [2024-06-14 16:06:46,963 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 215 selfloop transitions, 84 changer transitions 0/303 dead transitions. [2024-06-14 16:06:46,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 303 transitions, 4158 flow [2024-06-14 16:06:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:06:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:06:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-14 16:06:46,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 16:06:46,964 INFO L175 Difference]: Start difference. First operand has 215 places, 273 transitions, 3237 flow. Second operand 8 states and 144 transitions. [2024-06-14 16:06:46,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 303 transitions, 4158 flow [2024-06-14 16:06:47,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 303 transitions, 4023 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 16:06:47,194 INFO L231 Difference]: Finished difference. Result has 218 places, 282 transitions, 3448 flow [2024-06-14 16:06:47,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3104, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3448, PETRI_PLACES=218, PETRI_TRANSITIONS=282} [2024-06-14 16:06:47,194 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 176 predicate places. [2024-06-14 16:06:47,194 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 282 transitions, 3448 flow [2024-06-14 16:06:47,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:47,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:47,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:47,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 16:06:47,195 INFO L420 AbstractCegarLoop]: === Iteration 53 === 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:47,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2004471131, now seen corresponding path program 7 times [2024-06-14 16:06:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:47,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086955768] [2024-06-14 16:06:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:58,529 INFO 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:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:58,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086955768] [2024-06-14 16:06:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086955768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:58,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:58,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304145745] [2024-06-14 16:06:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:58,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:58,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:58,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:06:58,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 282 transitions, 3448 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:58,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:58,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:06:58,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:00,020 INFO L124 PetriNetUnfolderBase]: 2136/3324 cut-off events. [2024-06-14 16:07:00,021 INFO L125 PetriNetUnfolderBase]: For 161211/161214 co-relation queries the response was YES. [2024-06-14 16:07:00,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24718 conditions, 3324 events. 2136/3324 cut-off events. For 161211/161214 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17506 event pairs, 462 based on Foata normal form. 6/3327 useless extension candidates. Maximal degree in co-relation 24616. Up to 3095 conditions per place. [2024-06-14 16:07:00,048 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 239 selfloop transitions, 58 changer transitions 0/301 dead transitions. [2024-06-14 16:07:00,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 301 transitions, 4116 flow [2024-06-14 16:07:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:07:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:07:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 16:07:00,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-14 16:07:00,049 INFO L175 Difference]: Start difference. First operand has 218 places, 282 transitions, 3448 flow. Second operand 7 states and 127 transitions. [2024-06-14 16:07:00,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 301 transitions, 4116 flow [2024-06-14 16:07:00,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 301 transitions, 3973 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-14 16:07:00,303 INFO L231 Difference]: Finished difference. Result has 222 places, 282 transitions, 3438 flow [2024-06-14 16:07:00,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3305, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3438, PETRI_PLACES=222, PETRI_TRANSITIONS=282} [2024-06-14 16:07:00,303 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2024-06-14 16:07:00,303 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 282 transitions, 3438 flow [2024-06-14 16:07:00,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:00,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:00,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 16:07:00,304 INFO L420 AbstractCegarLoop]: === Iteration 54 === 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:00,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash 505651869, now seen corresponding path program 8 times [2024-06-14 16:07:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188082834] [2024-06-14 16:07:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:11,723 INFO 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:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188082834] [2024-06-14 16:07:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188082834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237667780] [2024-06-14 16:07:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:11,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:11,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:11,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:11,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:07:11,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 282 transitions, 3438 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:11,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:11,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:07:11,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:13,001 INFO L124 PetriNetUnfolderBase]: 2156/3356 cut-off events. [2024-06-14 16:07:13,001 INFO L125 PetriNetUnfolderBase]: For 163555/163558 co-relation queries the response was YES. [2024-06-14 16:07:13,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24567 conditions, 3356 events. 2156/3356 cut-off events. For 163555/163558 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17693 event pairs, 453 based on Foata normal form. 6/3359 useless extension candidates. Maximal degree in co-relation 24462. Up to 2992 conditions per place. [2024-06-14 16:07:13,032 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 212 selfloop transitions, 88 changer transitions 0/304 dead transitions. [2024-06-14 16:07:13,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 304 transitions, 4290 flow [2024-06-14 16:07:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:07:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:07:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 16:07:13,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-14 16:07:13,034 INFO L175 Difference]: Start difference. First operand has 222 places, 282 transitions, 3438 flow. Second operand 7 states and 129 transitions. [2024-06-14 16:07:13,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 304 transitions, 4290 flow [2024-06-14 16:07:13,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 304 transitions, 4161 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 16:07:13,293 INFO L231 Difference]: Finished difference. Result has 222 places, 285 transitions, 3565 flow [2024-06-14 16:07:13,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3313, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3565, PETRI_PLACES=222, PETRI_TRANSITIONS=285} [2024-06-14 16:07:13,294 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2024-06-14 16:07:13,294 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 285 transitions, 3565 flow [2024-06-14 16:07:13,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:13,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:13,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 16:07:13,295 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:07:13,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2067893225, now seen corresponding path program 9 times [2024-06-14 16:07:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241292042] [2024-06-14 16:07:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:24,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:07:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:24,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241292042] [2024-06-14 16:07:24,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241292042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:24,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:24,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203318162] [2024-06-14 16:07:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:24,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:24,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:24,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:07:24,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 285 transitions, 3565 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:24,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:24,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:07:24,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:26,104 INFO L124 PetriNetUnfolderBase]: 2176/3392 cut-off events. [2024-06-14 16:07:26,105 INFO L125 PetriNetUnfolderBase]: For 158987/158990 co-relation queries the response was YES. [2024-06-14 16:07:26,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24852 conditions, 3392 events. 2176/3392 cut-off events. For 158987/158990 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17971 event pairs, 474 based on Foata normal form. 6/3395 useless extension candidates. Maximal degree in co-relation 24747. Up to 3261 conditions per place. [2024-06-14 16:07:26,135 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 272 selfloop transitions, 23 changer transitions 0/299 dead transitions. [2024-06-14 16:07:26,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 299 transitions, 4269 flow [2024-06-14 16:07:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:07:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:07:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-14 16:07:26,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-14 16:07:26,136 INFO L175 Difference]: Start difference. First operand has 222 places, 285 transitions, 3565 flow. Second operand 7 states and 117 transitions. [2024-06-14 16:07:26,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 299 transitions, 4269 flow [2024-06-14 16:07:26,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 299 transitions, 4078 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-14 16:07:26,351 INFO L231 Difference]: Finished difference. Result has 223 places, 288 transitions, 3504 flow [2024-06-14 16:07:26,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3377, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3504, PETRI_PLACES=223, PETRI_TRANSITIONS=288} [2024-06-14 16:07:26,352 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places. [2024-06-14 16:07:26,352 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 288 transitions, 3504 flow [2024-06-14 16:07:26,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:26,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:26,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:26,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 16:07:26,352 INFO L420 AbstractCegarLoop]: === Iteration 56 === 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:26,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2062179305, now seen corresponding path program 10 times [2024-06-14 16:07:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907355383] [2024-06-14 16:07:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:37,736 INFO 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:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907355383] [2024-06-14 16:07:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907355383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:37,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866981074] [2024-06-14 16:07:37,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:37,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:37,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:37,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:37,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:07:37,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 288 transitions, 3504 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:37,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:37,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:07:37,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:39,076 INFO L124 PetriNetUnfolderBase]: 2164/3372 cut-off events. [2024-06-14 16:07:39,076 INFO L125 PetriNetUnfolderBase]: For 154189/154192 co-relation queries the response was YES. [2024-06-14 16:07:39,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24150 conditions, 3372 events. 2164/3372 cut-off events. For 154189/154192 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17867 event pairs, 458 based on Foata normal form. 6/3375 useless extension candidates. Maximal degree in co-relation 24046. Up to 3209 conditions per place. [2024-06-14 16:07:39,104 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 266 selfloop transitions, 31 changer transitions 0/301 dead transitions. [2024-06-14 16:07:39,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 301 transitions, 4160 flow [2024-06-14 16:07:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:07:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:07:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-14 16:07:39,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-14 16:07:39,105 INFO L175 Difference]: Start difference. First operand has 223 places, 288 transitions, 3504 flow. Second operand 7 states and 120 transitions. [2024-06-14 16:07:39,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 301 transitions, 4160 flow [2024-06-14 16:07:39,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 301 transitions, 4016 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-14 16:07:39,323 INFO L231 Difference]: Finished difference. Result has 225 places, 288 transitions, 3428 flow [2024-06-14 16:07:39,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3360, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3428, PETRI_PLACES=225, PETRI_TRANSITIONS=288} [2024-06-14 16:07:39,324 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 183 predicate places. [2024-06-14 16:07:39,324 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 288 transitions, 3428 flow [2024-06-14 16:07:39,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:39,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:39,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:39,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 16:07:39,324 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:07:39,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2067884297, now seen corresponding path program 2 times [2024-06-14 16:07:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:39,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372137942] [2024-06-14 16:07:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:39,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:07:53,403 INFO 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:53,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:07:53,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372137942] [2024-06-14 16:07:53,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372137942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:07:53,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:07:53,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:07:53,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186890031] [2024-06-14 16:07:53,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:07:53,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:07:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:07:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:07:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:07:53,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:07:53,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 288 transitions, 3428 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:53,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:07:53,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:07:53,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:07:54,889 INFO L124 PetriNetUnfolderBase]: 2208/3444 cut-off events. [2024-06-14 16:07:54,889 INFO L125 PetriNetUnfolderBase]: For 167525/167525 co-relation queries the response was YES. [2024-06-14 16:07:54,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24542 conditions, 3444 events. 2208/3444 cut-off events. For 167525/167525 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18322 event pairs, 479 based on Foata normal form. 12/3452 useless extension candidates. Maximal degree in co-relation 24438. Up to 3226 conditions per place. [2024-06-14 16:07:54,918 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 278 selfloop transitions, 27 changer transitions 0/309 dead transitions. [2024-06-14 16:07:54,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 309 transitions, 4184 flow [2024-06-14 16:07:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:07:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:07:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-14 16:07:54,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-14 16:07:54,920 INFO L175 Difference]: Start difference. First operand has 225 places, 288 transitions, 3428 flow. Second operand 7 states and 124 transitions. [2024-06-14 16:07:54,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 309 transitions, 4184 flow [2024-06-14 16:07:55,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 309 transitions, 3951 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 16:07:55,156 INFO L231 Difference]: Finished difference. Result has 224 places, 289 transitions, 3272 flow [2024-06-14 16:07:55,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3195, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3272, PETRI_PLACES=224, PETRI_TRANSITIONS=289} [2024-06-14 16:07:55,156 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2024-06-14 16:07:55,156 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 289 transitions, 3272 flow [2024-06-14 16:07:55,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:55,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:07:55,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:07:55,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 16:07:55,157 INFO L420 AbstractCegarLoop]: === Iteration 58 === 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:55,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:07:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2053599497, now seen corresponding path program 3 times [2024-06-14 16:07:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:07:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846705082] [2024-06-14 16:07:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:07:55,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:07:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:09,713 INFO 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:09,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:09,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846705082] [2024-06-14 16:08:09,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846705082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:09,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:09,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:08:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138268388] [2024-06-14 16:08:09,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:09,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:08:09,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:08:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:08:09,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:08:09,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 289 transitions, 3272 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:09,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:09,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:08:09,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:11,131 INFO L124 PetriNetUnfolderBase]: 2210/3450 cut-off events. [2024-06-14 16:08:11,131 INFO L125 PetriNetUnfolderBase]: For 163693/163693 co-relation queries the response was YES. [2024-06-14 16:08:11,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24148 conditions, 3450 events. 2210/3450 cut-off events. For 163693/163693 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18371 event pairs, 469 based on Foata normal form. 8/3454 useless extension candidates. Maximal degree in co-relation 24045. Up to 3142 conditions per place. [2024-06-14 16:08:11,166 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 279 selfloop transitions, 29 changer transitions 0/312 dead transitions. [2024-06-14 16:08:11,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 312 transitions, 4058 flow [2024-06-14 16:08:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:08:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:08:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 16:08:11,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-14 16:08:11,167 INFO L175 Difference]: Start difference. First operand has 224 places, 289 transitions, 3272 flow. Second operand 7 states and 125 transitions. [2024-06-14 16:08:11,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 312 transitions, 4058 flow [2024-06-14 16:08:11,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 312 transitions, 4001 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 16:08:11,429 INFO L231 Difference]: Finished difference. Result has 226 places, 290 transitions, 3297 flow [2024-06-14 16:08:11,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3215, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3297, PETRI_PLACES=226, PETRI_TRANSITIONS=290} [2024-06-14 16:08:11,430 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places. [2024-06-14 16:08:11,430 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 290 transitions, 3297 flow [2024-06-14 16:08:11,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:11,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:11,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:11,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 16:08:11,430 INFO L420 AbstractCegarLoop]: === Iteration 59 === 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:11,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:11,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1681271711, now seen corresponding path program 1 times [2024-06-14 16:08:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:11,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665098621] [2024-06-14 16:08:11,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:24,286 INFO 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:24,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:24,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665098621] [2024-06-14 16:08:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665098621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:24,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:24,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:08:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846047570] [2024-06-14 16:08:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:24,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:08:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:08:24,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:08:24,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:08:24,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 290 transitions, 3297 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:24,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:24,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:08:24,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:25,943 INFO L124 PetriNetUnfolderBase]: 2229/3497 cut-off events. [2024-06-14 16:08:25,944 INFO L125 PetriNetUnfolderBase]: For 186286/186319 co-relation queries the response was YES. [2024-06-14 16:08:25,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25209 conditions, 3497 events. 2229/3497 cut-off events. For 186286/186319 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18960 event pairs, 425 based on Foata normal form. 12/3491 useless extension candidates. Maximal degree in co-relation 25105. Up to 2815 conditions per place. [2024-06-14 16:08:25,974 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 203 selfloop transitions, 106 changer transitions 0/333 dead transitions. [2024-06-14 16:08:25,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 333 transitions, 4426 flow [2024-06-14 16:08:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:08:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:08:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-14 16:08:25,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-14 16:08:25,976 INFO L175 Difference]: Start difference. First operand has 226 places, 290 transitions, 3297 flow. Second operand 9 states and 174 transitions. [2024-06-14 16:08:25,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 333 transitions, 4426 flow [2024-06-14 16:08:26,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 333 transitions, 4362 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 16:08:26,285 INFO L231 Difference]: Finished difference. Result has 231 places, 300 transitions, 3664 flow [2024-06-14 16:08:26,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3233, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3664, PETRI_PLACES=231, PETRI_TRANSITIONS=300} [2024-06-14 16:08:26,285 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 189 predicate places. [2024-06-14 16:08:26,285 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 300 transitions, 3664 flow [2024-06-14 16:08:26,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:26,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:26,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:26,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 16:08:26,286 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:08:26,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash 172046937, now seen corresponding path program 2 times [2024-06-14 16:08:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186992512] [2024-06-14 16:08:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:26,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:39,992 INFO 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:39,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:39,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186992512] [2024-06-14 16:08:39,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186992512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:39,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:39,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:08:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112631949] [2024-06-14 16:08:39,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:39,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:08:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:08:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:08:40,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:08:40,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 300 transitions, 3664 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:40,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:40,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:08:40,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:41,735 INFO L124 PetriNetUnfolderBase]: 2294/3601 cut-off events. [2024-06-14 16:08:41,735 INFO L125 PetriNetUnfolderBase]: For 209339/209372 co-relation queries the response was YES. [2024-06-14 16:08:41,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26809 conditions, 3601 events. 2294/3601 cut-off events. For 209339/209372 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 19669 event pairs, 494 based on Foata normal form. 21/3604 useless extension candidates. Maximal degree in co-relation 26703. Up to 3120 conditions per place. [2024-06-14 16:08:41,766 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 197 selfloop transitions, 108 changer transitions 0/329 dead transitions. [2024-06-14 16:08:41,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 329 transitions, 4454 flow [2024-06-14 16:08:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:08:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:08:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-14 16:08:41,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2024-06-14 16:08:41,767 INFO L175 Difference]: Start difference. First operand has 231 places, 300 transitions, 3664 flow. Second operand 10 states and 183 transitions. [2024-06-14 16:08:41,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 329 transitions, 4454 flow [2024-06-14 16:08:42,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 329 transitions, 4302 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-14 16:08:42,083 INFO L231 Difference]: Finished difference. Result has 238 places, 303 transitions, 3822 flow [2024-06-14 16:08:42,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3516, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3822, PETRI_PLACES=238, PETRI_TRANSITIONS=303} [2024-06-14 16:08:42,083 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 196 predicate places. [2024-06-14 16:08:42,083 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 303 transitions, 3822 flow [2024-06-14 16:08:42,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:42,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:42,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:42,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 16:08:42,084 INFO L420 AbstractCegarLoop]: === Iteration 61 === 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:42,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1134148031, now seen corresponding path program 1 times [2024-06-14 16:08:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178884837] [2024-06-14 16:08:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:08:54,660 INFO 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:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:08:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178884837] [2024-06-14 16:08:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178884837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:08:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:08:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:08:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676755105] [2024-06-14 16:08:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:08:54,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:08:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:08:54,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:08:54,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:08:54,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:08:54,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 303 transitions, 3822 flow. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:54,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:08:54,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:08:54,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:08:56,252 INFO L124 PetriNetUnfolderBase]: 2400/3739 cut-off events. [2024-06-14 16:08:56,253 INFO L125 PetriNetUnfolderBase]: For 202349/202349 co-relation queries the response was YES. [2024-06-14 16:08:56,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28236 conditions, 3739 events. 2400/3739 cut-off events. For 202349/202349 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20194 event pairs, 484 based on Foata normal form. 2/3739 useless extension candidates. Maximal degree in co-relation 28127. Up to 3491 conditions per place. [2024-06-14 16:08:56,283 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 282 selfloop transitions, 61 changer transitions 0/347 dead transitions. [2024-06-14 16:08:56,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 347 transitions, 4953 flow [2024-06-14 16:08:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:08:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:08:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-14 16:08:56,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-14 16:08:56,286 INFO L175 Difference]: Start difference. First operand has 238 places, 303 transitions, 3822 flow. Second operand 9 states and 160 transitions. [2024-06-14 16:08:56,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 347 transitions, 4953 flow [2024-06-14 16:08:56,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 347 transitions, 4669 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-14 16:08:56,581 INFO L231 Difference]: Finished difference. Result has 240 places, 317 transitions, 3926 flow [2024-06-14 16:08:56,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3563, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3926, PETRI_PLACES=240, PETRI_TRANSITIONS=317} [2024-06-14 16:08:56,581 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 198 predicate places. [2024-06-14 16:08:56,582 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 317 transitions, 3926 flow [2024-06-14 16:08:56,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:08:56,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:08:56,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:08:56,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 16:08:56,582 INFO L420 AbstractCegarLoop]: === Iteration 62 === 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:56,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:08:56,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1136949191, now seen corresponding path program 2 times [2024-06-14 16:08:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:08:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228532923] [2024-06-14 16:08:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:08:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:08:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:08,724 INFO 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:09:08,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:08,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228532923] [2024-06-14 16:09:08,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228532923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:08,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:08,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:09:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074660864] [2024-06-14 16:09:08,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:08,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:09:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:08,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:09:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:09:08,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:09:08,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 317 transitions, 3926 flow. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:09:08,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:08,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:09:08,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:10,263 INFO L124 PetriNetUnfolderBase]: 2410/3753 cut-off events. [2024-06-14 16:09:10,263 INFO L125 PetriNetUnfolderBase]: For 196281/196281 co-relation queries the response was YES. [2024-06-14 16:09:10,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28304 conditions, 3753 events. 2410/3753 cut-off events. For 196281/196281 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20264 event pairs, 485 based on Foata normal form. 2/3753 useless extension candidates. Maximal degree in co-relation 28194. Up to 3551 conditions per place. [2024-06-14 16:09:10,295 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 283 selfloop transitions, 60 changer transitions 0/347 dead transitions. [2024-06-14 16:09:10,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 347 transitions, 4904 flow [2024-06-14 16:09:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:09:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:09:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-14 16:09:10,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-14 16:09:10,298 INFO L175 Difference]: Start difference. First operand has 240 places, 317 transitions, 3926 flow. Second operand 9 states and 156 transitions. [2024-06-14 16:09:10,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 347 transitions, 4904 flow [2024-06-14 16:09:10,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 347 transitions, 4775 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-14 16:09:10,601 INFO L231 Difference]: Finished difference. Result has 246 places, 323 transitions, 4065 flow [2024-06-14 16:09:10,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3809, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4065, PETRI_PLACES=246, PETRI_TRANSITIONS=323} [2024-06-14 16:09:10,601 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places. [2024-06-14 16:09:10,602 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 323 transitions, 4065 flow [2024-06-14 16:09:10,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:09:10,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:10,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:10,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 16:09:10,602 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:09:10,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1684128795, now seen corresponding path program 3 times [2024-06-14 16:09:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:10,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868023690] [2024-06-14 16:09:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:23,405 INFO 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:09:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868023690] [2024-06-14 16:09:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868023690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:23,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:23,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:09:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840173771] [2024-06-14 16:09:23,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:23,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:09:23,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:23,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:09:23,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:09:23,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:09:23,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 323 transitions, 4065 flow. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:09:23,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:23,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:09:23,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:24,939 INFO L124 PetriNetUnfolderBase]: 2420/3767 cut-off events. [2024-06-14 16:09:24,939 INFO L125 PetriNetUnfolderBase]: For 204312/204312 co-relation queries the response was YES. [2024-06-14 16:09:24,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28884 conditions, 3767 events. 2420/3767 cut-off events. For 204312/204312 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20336 event pairs, 485 based on Foata normal form. 2/3767 useless extension candidates. Maximal degree in co-relation 28771. Up to 3556 conditions per place. [2024-06-14 16:09:24,978 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 284 selfloop transitions, 65 changer transitions 0/353 dead transitions. [2024-06-14 16:09:24,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 353 transitions, 5033 flow [2024-06-14 16:09:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:09:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:09:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-14 16:09:24,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-14 16:09:24,981 INFO L175 Difference]: Start difference. First operand has 246 places, 323 transitions, 4065 flow. Second operand 9 states and 159 transitions. [2024-06-14 16:09:24,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 353 transitions, 5033 flow [2024-06-14 16:09:25,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 353 transitions, 4914 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-14 16:09:25,356 INFO L231 Difference]: Finished difference. Result has 250 places, 328 transitions, 4165 flow [2024-06-14 16:09:25,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3946, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4165, PETRI_PLACES=250, PETRI_TRANSITIONS=328} [2024-06-14 16:09:25,356 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 208 predicate places. [2024-06-14 16:09:25,356 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 328 transitions, 4165 flow [2024-06-14 16:09:25,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:09:25,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:25,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:25,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 16:09:25,357 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:09:25,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1799419841, now seen corresponding path program 3 times [2024-06-14 16:09:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856084631] [2024-06-14 16:09:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:37,920 INFO 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:09:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856084631] [2024-06-14 16:09:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856084631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:37,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:37,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:09:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853180321] [2024-06-14 16:09:37,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:37,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:09:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:37,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:09:37,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:09:38,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 16:09:38,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 328 transitions, 4165 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:09:38,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:38,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 16:09:38,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:39,748 INFO L124 PetriNetUnfolderBase]: 2355/3689 cut-off events. [2024-06-14 16:09:39,749 INFO L125 PetriNetUnfolderBase]: For 213287/213320 co-relation queries the response was YES. [2024-06-14 16:09:39,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28467 conditions, 3689 events. 2355/3689 cut-off events. For 213287/213320 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20163 event pairs, 498 based on Foata normal form. 4/3675 useless extension candidates. Maximal degree in co-relation 28352. Up to 3425 conditions per place. [2024-06-14 16:09:39,779 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 271 selfloop transitions, 45 changer transitions 0/347 dead transitions. [2024-06-14 16:09:39,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 347 transitions, 4885 flow [2024-06-14 16:09:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:09:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:09:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-14 16:09:39,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092140921409214 [2024-06-14 16:09:39,781 INFO L175 Difference]: Start difference. First operand has 250 places, 328 transitions, 4165 flow. Second operand 9 states and 151 transitions. [2024-06-14 16:09:39,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 347 transitions, 4885 flow [2024-06-14 16:09:40,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 347 transitions, 4780 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 16:09:40,193 INFO L231 Difference]: Finished difference. Result has 255 places, 332 transitions, 4223 flow [2024-06-14 16:09:40,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4060, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4223, PETRI_PLACES=255, PETRI_TRANSITIONS=332} [2024-06-14 16:09:40,194 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 213 predicate places. [2024-06-14 16:09:40,194 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 332 transitions, 4223 flow [2024-06-14 16:09:40,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:09:40,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:40,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:40,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 16:09:40,195 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:09:40,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1252235711, now seen corresponding path program 4 times [2024-06-14 16:09:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985889751] [2024-06-14 16:09:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:52,283 INFO 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:09:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:52,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985889751] [2024-06-14 16:09:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985889751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:09:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051594627] [2024-06-14 16:09:52,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:52,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:09:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:52,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:09:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:09:52,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 16:09:52,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 332 transitions, 4223 flow. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:09:52,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:52,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 16:09:52,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:53,936 INFO L124 PetriNetUnfolderBase]: 2462/3827 cut-off events. [2024-06-14 16:09:53,936 INFO L125 PetriNetUnfolderBase]: For 221539/221539 co-relation queries the response was YES. [2024-06-14 16:09:53,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29883 conditions, 3827 events. 2462/3827 cut-off events. For 221539/221539 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20688 event pairs, 487 based on Foata normal form. 2/3827 useless extension candidates. Maximal degree in co-relation 29765. Up to 3656 conditions per place. [2024-06-14 16:09:53,967 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 313 selfloop transitions, 44 changer transitions 0/361 dead transitions. [2024-06-14 16:09:53,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 361 transitions, 5253 flow [2024-06-14 16:09:53,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:09:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:09:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-14 16:09:53,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-14 16:09:53,969 INFO L175 Difference]: Start difference. First operand has 255 places, 332 transitions, 4223 flow. Second operand 9 states and 155 transitions. [2024-06-14 16:09:53,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 361 transitions, 5253 flow [2024-06-14 16:09:54,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 361 transitions, 5153 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 16:09:54,351 INFO L231 Difference]: Finished difference. Result has 261 places, 339 transitions, 4350 flow [2024-06-14 16:09:54,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4124, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4350, PETRI_PLACES=261, PETRI_TRANSITIONS=339} [2024-06-14 16:09:54,352 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 219 predicate places. [2024-06-14 16:09:54,352 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 339 transitions, 4350 flow [2024-06-14 16:09:54,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:09:54,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:54,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:54,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 16:09:54,353 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:09:54,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1252420285, now seen corresponding path program 1 times [2024-06-14 16:09:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950169045] [2024-06-14 16:09:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15