./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/safe029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe029_power.opt_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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:21:22,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:21:22,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:21:22,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:21:22,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:21:22,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:21:22,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:21:22,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:21:22,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:21:22,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:21:22,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:21:22,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:21:22,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:21:22,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:21:22,708 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:21:22,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:21:22,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:21:22,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:21:22,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:21:22,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:21:22,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:21:22,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:21:22,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:21:22,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:21:22,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:21:22,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:21:22,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:21:22,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:21:22,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:21:22,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:21:22,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:21:22,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:21:22,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:21:22,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:21:22,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:21:22,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:21:22,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:21:22,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:21:22,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:21:22,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:21:22,715 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:21:22,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:21:22,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:21:22,716 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 [2024-05-12 12:21:22,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:21:22,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:21:22,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:21:22,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:21:22,941 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:21:22,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-05-12 12:21:23,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:21:24,207 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:21:24,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-05-12 12:21:24,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ea4e40e/060fc84e382343b7bc5140013fb91d57/FLAGd59f069dc [2024-05-12 12:21:24,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ea4e40e/060fc84e382343b7bc5140013fb91d57 [2024-05-12 12:21:24,270 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:21:24,271 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:21:24,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-05-12 12:21:24,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:21:24,442 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:21:24,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:21:24,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:21:24,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:21:24,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:21:24" (1/2) ... [2024-05-12 12:21:24,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284574ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:24, skipping insertion in model container [2024-05-12 12:21:24,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:21:24" (1/2) ... [2024-05-12 12:21:24,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62dd2f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:24, skipping insertion in model container [2024-05-12 12:21:24,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:24" (2/2) ... [2024-05-12 12:21:24,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284574ec and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:24, skipping insertion in model container [2024-05-12 12:21:24,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:24" (2/2) ... [2024-05-12 12:21:24,451 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:21:24,496 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:21:24,498 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((((((((((((! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! 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_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$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_thd1) + (long long )x$r_buff0_thd2 >= 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$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_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$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_thd1) + (long long )x$r_buff1_thd2 >= 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$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) && (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_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$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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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_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$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 )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_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$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$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_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$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$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_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$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$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_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$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_thd1 + (long long )x$r_buff0_thd2 >= 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$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_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$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_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$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_thd1 + (long long )x$r_buff1_thd2 >= 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_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$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$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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_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$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 )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_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$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) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 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_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$read_delayed >= 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$read_delayed >= 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$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$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:21:24,498 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((((((((((((! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! 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_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$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_thd1) + (long long )x$r_buff0_thd2 >= 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$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_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$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_thd1) + (long long )x$r_buff1_thd2 >= 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$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) && (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_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$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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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_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$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 )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_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$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$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_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$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$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_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$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$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_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$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_thd1 + (long long )x$r_buff0_thd2 >= 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$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_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$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_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$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_thd1 + (long long )x$r_buff1_thd2 >= 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_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$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$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 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_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$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 )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_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$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) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 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_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$read_delayed >= 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$read_delayed >= 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$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$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:21:24,498 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:21:24,499 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-05-12 12:21:24,532 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:21:24,675 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2024-05-12 12:21:24,802 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:21:24,814 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:21:24,844 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:21:25,077 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:21:25,114 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:21:25,116 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25 WrapperNode [2024-05-12 12:21:25,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:21:25,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:21:25,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:21:25,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:21:25,123 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 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,152 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 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,220 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-05-12 12:21:25,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:21:25,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:21:25,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:21:25,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:21:25,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,278 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 12:21:25,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:21:25,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:21:25,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:21:25,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:21:25,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (1/1) ... [2024-05-12 12:21:25,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:21:25,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:21:25,369 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-05-12 12:21:25,383 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-05-12 12:21:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:21:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:21:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:21:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:21:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:21:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:21:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:21:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 12:21:25,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 12:21:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 12:21:25,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 12:21:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:21:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:21:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:21:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:21:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:21:25,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:21:25,408 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:21:25,504 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:21:25,506 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:21:26,082 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:21:26,082 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:21:26,252 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:21:26,252 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:21:26,252 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:21:26 BoogieIcfgContainer [2024-05-12 12:21:26,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:21:26,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:21:26,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:21:26,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:21:26,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:21:24" (1/4) ... [2024-05-12 12:21:26,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186de204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:21:26, skipping insertion in model container [2024-05-12 12:21:26,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:24" (2/4) ... [2024-05-12 12:21:26,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186de204 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:21:26, skipping insertion in model container [2024-05-12 12:21:26,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:25" (3/4) ... [2024-05-12 12:21:26,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186de204 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:21:26, skipping insertion in model container [2024-05-12 12:21:26,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:21:26" (4/4) ... [2024-05-12 12:21:26,258 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-05-12 12:21:26,270 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:21:26,271 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 12:21:26,271 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:21:26,318 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 12:21:26,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 12:21:26,364 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-05-12 12:21:26,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:21:26,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-05-12 12:21:26,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 12:21:26,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-05-12 12:21:26,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:21:26,423 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;@e131175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:21:26,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 12:21:26,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:21:26,438 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:21:26,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:21:26,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:26,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:21:26,439 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:26,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash 886025075, now seen corresponding path program 1 times [2024-05-12 12:21:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:26,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95845038] [2024-05-12 12:21:26,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:29,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95845038] [2024-05-12 12:21:29,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95845038] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:29,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:29,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:21:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588956470] [2024-05-12 12:21:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:29,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:21:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:29,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:21:29,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:21:29,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:29,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:29,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:29,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:29,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:29,792 INFO L124 PetriNetUnfolderBase]: 543/911 cut-off events. [2024-05-12 12:21:29,792 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-05-12 12:21:29,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 911 events. 543/911 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4389 event pairs, 234 based on Foata normal form. 43/899 useless extension candidates. Maximal degree in co-relation 1819. Up to 892 conditions per place. [2024-05-12 12:21:29,801 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-05-12 12:21:29,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 175 flow [2024-05-12 12:21:29,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:21:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:21:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-05-12 12:21:29,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-05-12 12:21:29,811 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 69 transitions. [2024-05-12 12:21:29,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 175 flow [2024-05-12 12:21:29,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:21:29,816 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 98 flow [2024-05-12 12:21:29,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2024-05-12 12:21:29,820 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-05-12 12:21:29,820 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 98 flow [2024-05-12 12:21:29,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:29,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:29,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:29,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:21:29,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:29,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1066589650, now seen corresponding path program 1 times [2024-05-12 12:21:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866344832] [2024-05-12 12:21:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866344832] [2024-05-12 12:21:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866344832] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:31,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:31,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:21:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048074295] [2024-05-12 12:21:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:31,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:21:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:31,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:21:31,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:21:31,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:31,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:31,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:31,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:31,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:31,645 INFO L124 PetriNetUnfolderBase]: 539/905 cut-off events. [2024-05-12 12:21:31,646 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-05-12 12:21:31,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 905 events. 539/905 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4338 event pairs, 182 based on Foata normal form. 2/859 useless extension candidates. Maximal degree in co-relation 2025. Up to 867 conditions per place. [2024-05-12 12:21:31,651 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 43 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2024-05-12 12:21:31,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 248 flow [2024-05-12 12:21:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:21:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:21:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-05-12 12:21:31,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-05-12 12:21:31,655 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 98 flow. Second operand 4 states and 88 transitions. [2024-05-12 12:21:31,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 248 flow [2024-05-12 12:21:31,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:21:31,658 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 132 flow [2024-05-12 12:21:31,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-05-12 12:21:31,660 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-05-12 12:21:31,661 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 132 flow [2024-05-12 12:21:31,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:31,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:31,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:31,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:21:31,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:31,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:31,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1295458620, now seen corresponding path program 1 times [2024-05-12 12:21:31,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:31,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915627241] [2024-05-12 12:21:31,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:31,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:33,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:33,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915627241] [2024-05-12 12:21:33,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915627241] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:33,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:33,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:21:33,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173316070] [2024-05-12 12:21:33,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:33,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:21:33,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:33,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:21:33,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:21:33,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:33,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:33,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:33,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:33,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:33,427 INFO L124 PetriNetUnfolderBase]: 531/1016 cut-off events. [2024-05-12 12:21:33,428 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2024-05-12 12:21:33,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 1016 events. 531/1016 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5426 event pairs, 165 based on Foata normal form. 4/933 useless extension candidates. Maximal degree in co-relation 2312. Up to 838 conditions per place. [2024-05-12 12:21:33,432 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 50 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-05-12 12:21:33,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 360 flow [2024-05-12 12:21:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:21:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:21:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-05-12 12:21:33,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-05-12 12:21:33,434 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 132 flow. Second operand 5 states and 104 transitions. [2024-05-12 12:21:33,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 360 flow [2024-05-12 12:21:33,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 334 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-05-12 12:21:33,437 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 229 flow [2024-05-12 12:21:33,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2024-05-12 12:21:33,437 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-05-12 12:21:33,437 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 229 flow [2024-05-12 12:21:33,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:33,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:33,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:33,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:21:33,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:33,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1295652603, now seen corresponding path program 1 times [2024-05-12 12:21:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:33,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869639811] [2024-05-12 12:21:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:33,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869639811] [2024-05-12 12:21:33,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869639811] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:33,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:33,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:21:33,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274304608] [2024-05-12 12:21:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:33,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:21:33,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:33,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:21:33,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:21:33,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-05-12 12:21:33,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:33,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:33,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-05-12 12:21:33,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:33,662 INFO L124 PetriNetUnfolderBase]: 185/480 cut-off events. [2024-05-12 12:21:33,662 INFO L125 PetriNetUnfolderBase]: For 259/285 co-relation queries the response was YES. [2024-05-12 12:21:33,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 480 events. 185/480 cut-off events. For 259/285 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2798 event pairs, 80 based on Foata normal form. 13/466 useless extension candidates. Maximal degree in co-relation 1039. Up to 286 conditions per place. [2024-05-12 12:21:33,666 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-05-12 12:21:33,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 272 flow [2024-05-12 12:21:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:21:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:21:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-05-12 12:21:33,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-05-12 12:21:33,669 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 229 flow. Second operand 3 states and 75 transitions. [2024-05-12 12:21:33,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 272 flow [2024-05-12 12:21:33,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 268 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-05-12 12:21:33,673 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 196 flow [2024-05-12 12:21:33,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2024-05-12 12:21:33,674 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-05-12 12:21:33,674 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 196 flow [2024-05-12 12:21:33,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:33,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:33,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:33,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:21:33,675 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:33,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash -285316097, now seen corresponding path program 1 times [2024-05-12 12:21:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122658479] [2024-05-12 12:21:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:33,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122658479] [2024-05-12 12:21:35,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122658479] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:35,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:35,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:35,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267651398] [2024-05-12 12:21:35,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:35,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:35,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:35,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:35,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:35,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:35,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:35,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:35,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:36,030 INFO L124 PetriNetUnfolderBase]: 449/864 cut-off events. [2024-05-12 12:21:36,031 INFO L125 PetriNetUnfolderBase]: For 628/628 co-relation queries the response was YES. [2024-05-12 12:21:36,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2127 conditions, 864 events. 449/864 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4321 event pairs, 144 based on Foata normal form. 4/832 useless extension candidates. Maximal degree in co-relation 2105. Up to 678 conditions per place. [2024-05-12 12:21:36,036 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 49 selfloop transitions, 12 changer transitions 1/69 dead transitions. [2024-05-12 12:21:36,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 378 flow [2024-05-12 12:21:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-05-12 12:21:36,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-05-12 12:21:36,041 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 196 flow. Second operand 6 states and 114 transitions. [2024-05-12 12:21:36,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 378 flow [2024-05-12 12:21:36,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:21:36,046 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 217 flow [2024-05-12 12:21:36,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-05-12 12:21:36,048 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2024-05-12 12:21:36,048 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 217 flow [2024-05-12 12:21:36,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:36,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:36,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:36,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:21:36,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:36,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash 418349089, now seen corresponding path program 1 times [2024-05-12 12:21:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845017296] [2024-05-12 12:21:36,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845017296] [2024-05-12 12:21:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845017296] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:21:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467605511] [2024-05-12 12:21:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:38,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:21:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:21:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:21:38,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:38,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:38,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:38,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:38,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:39,263 INFO L124 PetriNetUnfolderBase]: 452/871 cut-off events. [2024-05-12 12:21:39,263 INFO L125 PetriNetUnfolderBase]: For 771/771 co-relation queries the response was YES. [2024-05-12 12:21:39,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2241 conditions, 871 events. 452/871 cut-off events. For 771/771 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4314 event pairs, 185 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 2218. Up to 738 conditions per place. [2024-05-12 12:21:39,269 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 49 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2024-05-12 12:21:39,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 388 flow [2024-05-12 12:21:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:21:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:21:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-05-12 12:21:39,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-05-12 12:21:39,271 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 217 flow. Second operand 5 states and 82 transitions. [2024-05-12 12:21:39,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 388 flow [2024-05-12 12:21:39,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 355 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:39,275 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 246 flow [2024-05-12 12:21:39,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-05-12 12:21:39,275 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2024-05-12 12:21:39,276 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 246 flow [2024-05-12 12:21:39,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:39,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:39,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:39,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:21:39,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:39,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash 61577256, now seen corresponding path program 1 times [2024-05-12 12:21:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:39,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496577355] [2024-05-12 12:21:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:39,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496577355] [2024-05-12 12:21:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496577355] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97001358] [2024-05-12 12:21:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:41,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:41,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:41,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:41,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:41,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:41,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:42,250 INFO L124 PetriNetUnfolderBase]: 479/916 cut-off events. [2024-05-12 12:21:42,251 INFO L125 PetriNetUnfolderBase]: For 994/1000 co-relation queries the response was YES. [2024-05-12 12:21:42,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 916 events. 479/916 cut-off events. For 994/1000 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4629 event pairs, 174 based on Foata normal form. 8/887 useless extension candidates. Maximal degree in co-relation 2443. Up to 709 conditions per place. [2024-05-12 12:21:42,256 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 58 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2024-05-12 12:21:42,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 493 flow [2024-05-12 12:21:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-05-12 12:21:42,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2024-05-12 12:21:42,258 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 246 flow. Second operand 6 states and 103 transitions. [2024-05-12 12:21:42,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 493 flow [2024-05-12 12:21:42,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 484 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-05-12 12:21:42,261 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 340 flow [2024-05-12 12:21:42,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2024-05-12 12:21:42,263 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-05-12 12:21:42,263 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 340 flow [2024-05-12 12:21:42,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:42,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:42,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:42,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:21:42,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:42,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash -441086894, now seen corresponding path program 1 times [2024-05-12 12:21:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:42,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597412415] [2024-05-12 12:21:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597412415] [2024-05-12 12:21:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597412415] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712883295] [2024-05-12 12:21:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:44,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:44,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:45,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:45,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 340 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:45,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:45,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:45,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:45,355 INFO L124 PetriNetUnfolderBase]: 501/965 cut-off events. [2024-05-12 12:21:45,355 INFO L125 PetriNetUnfolderBase]: For 1596/1596 co-relation queries the response was YES. [2024-05-12 12:21:45,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 965 events. 501/965 cut-off events. For 1596/1596 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4906 event pairs, 191 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 2966. Up to 798 conditions per place. [2024-05-12 12:21:45,360 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 65 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2024-05-12 12:21:45,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 602 flow [2024-05-12 12:21:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-05-12 12:21:45,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-05-12 12:21:45,361 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 340 flow. Second operand 7 states and 114 transitions. [2024-05-12 12:21:45,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 602 flow [2024-05-12 12:21:45,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 594 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 12:21:45,365 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 429 flow [2024-05-12 12:21:45,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2024-05-12 12:21:45,367 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2024-05-12 12:21:45,367 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 429 flow [2024-05-12 12:21:45,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:45,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:45,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:45,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:21:45,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:45,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1903142994, now seen corresponding path program 2 times [2024-05-12 12:21:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240364077] [2024-05-12 12:21:45,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240364077] [2024-05-12 12:21:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240364077] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:48,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304956106] [2024-05-12 12:21:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:48,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:48,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:48,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:48,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 429 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:48,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:48,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:48,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:48,495 INFO L124 PetriNetUnfolderBase]: 514/988 cut-off events. [2024-05-12 12:21:48,495 INFO L125 PetriNetUnfolderBase]: For 2114/2114 co-relation queries the response was YES. [2024-05-12 12:21:48,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 988 events. 514/988 cut-off events. For 2114/2114 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5036 event pairs, 190 based on Foata normal form. 1/946 useless extension candidates. Maximal degree in co-relation 3221. Up to 808 conditions per place. [2024-05-12 12:21:48,501 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 64 selfloop transitions, 15 changer transitions 0/85 dead transitions. [2024-05-12 12:21:48,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 660 flow [2024-05-12 12:21:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-05-12 12:21:48,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-05-12 12:21:48,502 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 429 flow. Second operand 6 states and 99 transitions. [2024-05-12 12:21:48,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 660 flow [2024-05-12 12:21:48,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 627 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:48,506 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 457 flow [2024-05-12 12:21:48,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2024-05-12 12:21:48,507 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2024-05-12 12:21:48,507 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 457 flow [2024-05-12 12:21:48,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:48,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:48,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:48,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:21:48,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:48,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1908886674, now seen corresponding path program 3 times [2024-05-12 12:21:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:48,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043186191] [2024-05-12 12:21:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043186191] [2024-05-12 12:21:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043186191] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003918368] [2024-05-12 12:21:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:51,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:51,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:51,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 457 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:51,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:51,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:51,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:51,465 INFO L124 PetriNetUnfolderBase]: 509/975 cut-off events. [2024-05-12 12:21:51,466 INFO L125 PetriNetUnfolderBase]: For 2428/2436 co-relation queries the response was YES. [2024-05-12 12:21:51,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3286 conditions, 975 events. 509/975 cut-off events. For 2428/2436 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4965 event pairs, 177 based on Foata normal form. 10/944 useless extension candidates. Maximal degree in co-relation 3252. Up to 724 conditions per place. [2024-05-12 12:21:51,471 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 61 selfloop transitions, 19 changer transitions 0/86 dead transitions. [2024-05-12 12:21:51,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 679 flow [2024-05-12 12:21:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-05-12 12:21:51,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 12:21:51,472 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 457 flow. Second operand 6 states and 102 transitions. [2024-05-12 12:21:51,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 679 flow [2024-05-12 12:21:51,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 86 transitions, 643 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:51,477 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 466 flow [2024-05-12 12:21:51,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2024-05-12 12:21:51,479 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2024-05-12 12:21:51,479 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 466 flow [2024-05-12 12:21:51,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:51,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:51,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:51,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:21:51,479 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:51,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1693430944, now seen corresponding path program 1 times [2024-05-12 12:21:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717404647] [2024-05-12 12:21:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:54,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:54,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717404647] [2024-05-12 12:21:54,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717404647] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:54,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:54,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:54,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336443195] [2024-05-12 12:21:54,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:54,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:54,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:54,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:54,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:54,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 466 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:54,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:54,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:54,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:55,162 INFO L124 PetriNetUnfolderBase]: 525/1000 cut-off events. [2024-05-12 12:21:55,162 INFO L125 PetriNetUnfolderBase]: For 2380/2388 co-relation queries the response was YES. [2024-05-12 12:21:55,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3385 conditions, 1000 events. 525/1000 cut-off events. For 2380/2388 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5107 event pairs, 173 based on Foata normal form. 10/969 useless extension candidates. Maximal degree in co-relation 3350. Up to 725 conditions per place. [2024-05-12 12:21:55,167 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 64 selfloop transitions, 25 changer transitions 0/95 dead transitions. [2024-05-12 12:21:55,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 95 transitions, 744 flow [2024-05-12 12:21:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-05-12 12:21:55,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 12:21:55,169 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 466 flow. Second operand 7 states and 119 transitions. [2024-05-12 12:21:55,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 95 transitions, 744 flow [2024-05-12 12:21:55,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 95 transitions, 693 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-05-12 12:21:55,174 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 502 flow [2024-05-12 12:21:55,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2024-05-12 12:21:55,175 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-05-12 12:21:55,175 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 502 flow [2024-05-12 12:21:55,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:55,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:55,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:55,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:21:55,175 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:55,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2057376332, now seen corresponding path program 1 times [2024-05-12 12:21:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:55,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855175412] [2024-05-12 12:21:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:55,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:57,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:57,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855175412] [2024-05-12 12:21:57,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855175412] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:57,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:57,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:57,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947701757] [2024-05-12 12:21:57,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:57,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:57,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:57,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:57,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:57,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 502 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:57,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:57,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:57,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:58,300 INFO L124 PetriNetUnfolderBase]: 547/1044 cut-off events. [2024-05-12 12:21:58,300 INFO L125 PetriNetUnfolderBase]: For 2664/2664 co-relation queries the response was YES. [2024-05-12 12:21:58,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 1044 events. 547/1044 cut-off events. For 2664/2664 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5376 event pairs, 140 based on Foata normal form. 2/1001 useless extension candidates. Maximal degree in co-relation 3669. Up to 820 conditions per place. [2024-05-12 12:21:58,306 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 74 selfloop transitions, 24 changer transitions 0/104 dead transitions. [2024-05-12 12:21:58,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 812 flow [2024-05-12 12:21:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-05-12 12:21:58,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2024-05-12 12:21:58,308 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 502 flow. Second operand 7 states and 121 transitions. [2024-05-12 12:21:58,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 812 flow [2024-05-12 12:21:58,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 753 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 12:21:58,317 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 550 flow [2024-05-12 12:21:58,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=550, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2024-05-12 12:21:58,317 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2024-05-12 12:21:58,318 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 550 flow [2024-05-12 12:21:58,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:58,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:58,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:58,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:21:58,318 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:58,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:58,319 INFO L85 PathProgramCache]: Analyzing trace with hash 281257452, now seen corresponding path program 2 times [2024-05-12 12:21:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:58,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325321155] [2024-05-12 12:21:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:58,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:01,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325321155] [2024-05-12 12:22:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325321155] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:01,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:01,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:01,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273146190] [2024-05-12 12:22:01,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:01,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:01,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:01,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:01,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:01,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:01,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 550 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:01,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:01,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:01,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:01,583 INFO L124 PetriNetUnfolderBase]: 583/1092 cut-off events. [2024-05-12 12:22:01,583 INFO L125 PetriNetUnfolderBase]: For 3420/3420 co-relation queries the response was YES. [2024-05-12 12:22:01,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4109 conditions, 1092 events. 583/1092 cut-off events. For 3420/3420 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5552 event pairs, 133 based on Foata normal form. 2/1051 useless extension candidates. Maximal degree in co-relation 4071. Up to 821 conditions per place. [2024-05-12 12:22:01,591 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 79 selfloop transitions, 30 changer transitions 0/115 dead transitions. [2024-05-12 12:22:01,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 968 flow [2024-05-12 12:22:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-05-12 12:22:01,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2024-05-12 12:22:01,592 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 550 flow. Second operand 7 states and 121 transitions. [2024-05-12 12:22:01,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 968 flow [2024-05-12 12:22:01,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 929 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:01,598 INFO L231 Difference]: Finished difference. Result has 81 places, 90 transitions, 701 flow [2024-05-12 12:22:01,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=701, PETRI_PLACES=81, PETRI_TRANSITIONS=90} [2024-05-12 12:22:01,599 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2024-05-12 12:22:01,599 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 701 flow [2024-05-12 12:22:01,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:01,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:01,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:01,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:22:01,599 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:01,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -957028062, now seen corresponding path program 3 times [2024-05-12 12:22:01,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:01,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917705713] [2024-05-12 12:22:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:01,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:04,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:04,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917705713] [2024-05-12 12:22:04,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917705713] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:04,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:04,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:04,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81027759] [2024-05-12 12:22:04,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:04,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:04,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:04,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:04,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:04,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:04,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 701 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:04,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:04,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:04,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:05,018 INFO L124 PetriNetUnfolderBase]: 649/1186 cut-off events. [2024-05-12 12:22:05,019 INFO L125 PetriNetUnfolderBase]: For 4857/4857 co-relation queries the response was YES. [2024-05-12 12:22:05,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4759 conditions, 1186 events. 649/1186 cut-off events. For 4857/4857 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6056 event pairs, 96 based on Foata normal form. 6/1151 useless extension candidates. Maximal degree in co-relation 4719. Up to 647 conditions per place. [2024-05-12 12:22:05,031 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 101 selfloop transitions, 43 changer transitions 0/150 dead transitions. [2024-05-12 12:22:05,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 150 transitions, 1352 flow [2024-05-12 12:22:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 12:22:05,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-05-12 12:22:05,034 INFO L175 Difference]: Start difference. First operand has 81 places, 90 transitions, 701 flow. Second operand 8 states and 146 transitions. [2024-05-12 12:22:05,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 150 transitions, 1352 flow [2024-05-12 12:22:05,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 150 transitions, 1292 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-05-12 12:22:05,042 INFO L231 Difference]: Finished difference. Result has 87 places, 110 transitions, 951 flow [2024-05-12 12:22:05,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=951, PETRI_PLACES=87, PETRI_TRANSITIONS=110} [2024-05-12 12:22:05,043 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2024-05-12 12:22:05,043 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 110 transitions, 951 flow [2024-05-12 12:22:05,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:05,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:05,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:05,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:22:05,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:05,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -953777785, now seen corresponding path program 1 times [2024-05-12 12:22:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:05,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999902854] [2024-05-12 12:22:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:05,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:08,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:08,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999902854] [2024-05-12 12:22:08,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999902854] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:08,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:08,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:08,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819123157] [2024-05-12 12:22:08,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:08,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:08,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:08,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:08,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:08,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:08,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 110 transitions, 951 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:08,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:08,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:08,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:09,025 INFO L124 PetriNetUnfolderBase]: 751/1368 cut-off events. [2024-05-12 12:22:09,026 INFO L125 PetriNetUnfolderBase]: For 7043/7043 co-relation queries the response was YES. [2024-05-12 12:22:09,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5977 conditions, 1368 events. 751/1368 cut-off events. For 7043/7043 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7309 event pairs, 96 based on Foata normal form. 16/1343 useless extension candidates. Maximal degree in co-relation 5934. Up to 726 conditions per place. [2024-05-12 12:22:09,034 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 112 selfloop transitions, 57 changer transitions 0/175 dead transitions. [2024-05-12 12:22:09,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 175 transitions, 1751 flow [2024-05-12 12:22:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-05-12 12:22:09,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2024-05-12 12:22:09,035 INFO L175 Difference]: Start difference. First operand has 87 places, 110 transitions, 951 flow. Second operand 9 states and 165 transitions. [2024-05-12 12:22:09,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 175 transitions, 1751 flow [2024-05-12 12:22:09,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 175 transitions, 1680 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:09,052 INFO L231 Difference]: Finished difference. Result has 96 places, 132 transitions, 1330 flow [2024-05-12 12:22:09,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1330, PETRI_PLACES=96, PETRI_TRANSITIONS=132} [2024-05-12 12:22:09,053 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2024-05-12 12:22:09,053 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 132 transitions, 1330 flow [2024-05-12 12:22:09,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:09,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:09,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:09,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:22:09,053 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:09,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash 168822819, now seen corresponding path program 1 times [2024-05-12 12:22:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:09,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747559827] [2024-05-12 12:22:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747559827] [2024-05-12 12:22:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747559827] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:12,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:12,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813544119] [2024-05-12 12:22:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:12,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:12,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:12,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 132 transitions, 1330 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:12,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:12,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:12,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:12,568 INFO L124 PetriNetUnfolderBase]: 753/1371 cut-off events. [2024-05-12 12:22:12,569 INFO L125 PetriNetUnfolderBase]: For 7381/7381 co-relation queries the response was YES. [2024-05-12 12:22:12,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 1371 events. 753/1371 cut-off events. For 7381/7381 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7334 event pairs, 170 based on Foata normal form. 1/1331 useless extension candidates. Maximal degree in co-relation 6530. Up to 1150 conditions per place. [2024-05-12 12:22:12,578 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 126 selfloop transitions, 30 changer transitions 0/162 dead transitions. [2024-05-12 12:22:12,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 162 transitions, 1803 flow [2024-05-12 12:22:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-05-12 12:22:12,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-05-12 12:22:12,580 INFO L175 Difference]: Start difference. First operand has 96 places, 132 transitions, 1330 flow. Second operand 7 states and 122 transitions. [2024-05-12 12:22:12,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 162 transitions, 1803 flow [2024-05-12 12:22:12,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 162 transitions, 1705 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:12,599 INFO L231 Difference]: Finished difference. Result has 101 places, 139 transitions, 1407 flow [2024-05-12 12:22:12,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1407, PETRI_PLACES=101, PETRI_TRANSITIONS=139} [2024-05-12 12:22:12,599 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 61 predicate places. [2024-05-12 12:22:12,599 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 139 transitions, 1407 flow [2024-05-12 12:22:12,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:12,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:12,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:12,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:22:12,600 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:12,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash 125299155, now seen corresponding path program 1 times [2024-05-12 12:22:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:12,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199024221] [2024-05-12 12:22:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:12,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:15,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:15,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199024221] [2024-05-12 12:22:15,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199024221] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:15,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:15,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809635701] [2024-05-12 12:22:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:15,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:15,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:15,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:15,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 139 transitions, 1407 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05-12 12:22:15,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:15,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:15,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:15,953 INFO L124 PetriNetUnfolderBase]: 773/1398 cut-off events. [2024-05-12 12:22:15,953 INFO L125 PetriNetUnfolderBase]: For 7786/7786 co-relation queries the response was YES. [2024-05-12 12:22:15,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6785 conditions, 1398 events. 773/1398 cut-off events. For 7786/7786 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7444 event pairs, 171 based on Foata normal form. 2/1360 useless extension candidates. Maximal degree in co-relation 6734. Up to 1166 conditions per place. [2024-05-12 12:22:15,962 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 135 selfloop transitions, 30 changer transitions 0/171 dead transitions. [2024-05-12 12:22:15,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 171 transitions, 1875 flow [2024-05-12 12:22:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-05-12 12:22:15,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756944444444444 [2024-05-12 12:22:15,976 INFO L175 Difference]: Start difference. First operand has 101 places, 139 transitions, 1407 flow. Second operand 8 states and 137 transitions. [2024-05-12 12:22:15,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 171 transitions, 1875 flow [2024-05-12 12:22:15,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 171 transitions, 1841 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:15,991 INFO L231 Difference]: Finished difference. Result has 106 places, 142 transitions, 1481 flow [2024-05-12 12:22:15,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1481, PETRI_PLACES=106, PETRI_TRANSITIONS=142} [2024-05-12 12:22:15,992 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 66 predicate places. [2024-05-12 12:22:15,992 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 142 transitions, 1481 flow [2024-05-12 12:22:15,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05-12 12:22:15,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:15,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:15,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:22:15,992 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:15,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 129053565, now seen corresponding path program 2 times [2024-05-12 12:22:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682541039] [2024-05-12 12:22:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:18,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682541039] [2024-05-12 12:22:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682541039] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:18,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:18,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:18,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333996841] [2024-05-12 12:22:18,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:18,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:18,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:18,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:18,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:18,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:18,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 142 transitions, 1481 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05-12 12:22:18,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:18,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:18,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:18,982 INFO L124 PetriNetUnfolderBase]: 789/1430 cut-off events. [2024-05-12 12:22:18,982 INFO L125 PetriNetUnfolderBase]: For 9066/9066 co-relation queries the response was YES. [2024-05-12 12:22:18,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7016 conditions, 1430 events. 789/1430 cut-off events. For 9066/9066 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7654 event pairs, 147 based on Foata normal form. 4/1393 useless extension candidates. Maximal degree in co-relation 6964. Up to 829 conditions per place. [2024-05-12 12:22:18,991 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 97 selfloop transitions, 72 changer transitions 0/175 dead transitions. [2024-05-12 12:22:18,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 175 transitions, 2097 flow [2024-05-12 12:22:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-05-12 12:22:18,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 12:22:18,993 INFO L175 Difference]: Start difference. First operand has 106 places, 142 transitions, 1481 flow. Second operand 8 states and 140 transitions. [2024-05-12 12:22:18,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 175 transitions, 2097 flow [2024-05-12 12:22:19,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 175 transitions, 2019 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:19,012 INFO L231 Difference]: Finished difference. Result has 110 places, 149 transitions, 1687 flow [2024-05-12 12:22:19,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1687, PETRI_PLACES=110, PETRI_TRANSITIONS=149} [2024-05-12 12:22:19,012 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2024-05-12 12:22:19,012 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 149 transitions, 1687 flow [2024-05-12 12:22:19,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05-12 12:22:19,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:19,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:19,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:22:19,013 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:19,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2009911513, now seen corresponding path program 3 times [2024-05-12 12:22:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:19,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141201889] [2024-05-12 12:22:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141201889] [2024-05-12 12:22:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141201889] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:22,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:22,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:22,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497558859] [2024-05-12 12:22:22,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:22,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:22,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:22,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:22,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:22,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:22,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 149 transitions, 1687 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:22,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:22,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:22,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:22,607 INFO L124 PetriNetUnfolderBase]: 797/1429 cut-off events. [2024-05-12 12:22:22,607 INFO L125 PetriNetUnfolderBase]: For 9943/9943 co-relation queries the response was YES. [2024-05-12 12:22:22,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7461 conditions, 1429 events. 797/1429 cut-off events. For 9943/9943 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7612 event pairs, 144 based on Foata normal form. 2/1392 useless extension candidates. Maximal degree in co-relation 7406. Up to 832 conditions per place. [2024-05-12 12:22:22,617 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 106 selfloop transitions, 68 changer transitions 0/180 dead transitions. [2024-05-12 12:22:22,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 180 transitions, 2226 flow [2024-05-12 12:22:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 12:22:22,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-05-12 12:22:22,618 INFO L175 Difference]: Start difference. First operand has 110 places, 149 transitions, 1687 flow. Second operand 8 states and 142 transitions. [2024-05-12 12:22:22,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 180 transitions, 2226 flow [2024-05-12 12:22:22,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 180 transitions, 2098 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:22,640 INFO L231 Difference]: Finished difference. Result has 115 places, 152 transitions, 1754 flow [2024-05-12 12:22:22,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1754, PETRI_PLACES=115, PETRI_TRANSITIONS=152} [2024-05-12 12:22:22,640 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 75 predicate places. [2024-05-12 12:22:22,640 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 152 transitions, 1754 flow [2024-05-12 12:22:22,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:22,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:22,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:22,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:22:22,641 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:22,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 497361253, now seen corresponding path program 1 times [2024-05-12 12:22:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293747512] [2024-05-12 12:22:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293747512] [2024-05-12 12:22:25,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293747512] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:25,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:25,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:25,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759272169] [2024-05-12 12:22:25,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:25,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:25,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:25,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:25,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:26,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:26,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 152 transitions, 1754 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05-12 12:22:26,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:26,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:26,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:26,591 INFO L124 PetriNetUnfolderBase]: 798/1433 cut-off events. [2024-05-12 12:22:26,592 INFO L125 PetriNetUnfolderBase]: For 10222/10222 co-relation queries the response was YES. [2024-05-12 12:22:26,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7501 conditions, 1433 events. 798/1433 cut-off events. For 10222/10222 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7643 event pairs, 154 based on Foata normal form. 1/1394 useless extension candidates. Maximal degree in co-relation 7444. Up to 1143 conditions per place. [2024-05-12 12:22:26,601 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 145 selfloop transitions, 41 changer transitions 0/192 dead transitions. [2024-05-12 12:22:26,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 192 transitions, 2370 flow [2024-05-12 12:22:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 12:22:26,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-05-12 12:22:26,603 INFO L175 Difference]: Start difference. First operand has 115 places, 152 transitions, 1754 flow. Second operand 9 states and 151 transitions. [2024-05-12 12:22:26,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 192 transitions, 2370 flow [2024-05-12 12:22:26,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 192 transitions, 2250 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 12:22:26,630 INFO L231 Difference]: Finished difference. Result has 119 places, 157 transitions, 1803 flow [2024-05-12 12:22:26,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1803, PETRI_PLACES=119, PETRI_TRANSITIONS=157} [2024-05-12 12:22:26,630 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 79 predicate places. [2024-05-12 12:22:26,630 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 157 transitions, 1803 flow [2024-05-12 12:22:26,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-05-12 12:22:26,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:26,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:22:26,631 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:26,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1448995765, now seen corresponding path program 1 times [2024-05-12 12:22:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054930842] [2024-05-12 12:22:26,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:29,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:29,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054930842] [2024-05-12 12:22:29,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054930842] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:29,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:29,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:29,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626144755] [2024-05-12 12:22:29,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:29,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:29,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:29,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:29,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 157 transitions, 1803 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:29,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:29,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:29,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:30,257 INFO L124 PetriNetUnfolderBase]: 816/1460 cut-off events. [2024-05-12 12:22:30,257 INFO L125 PetriNetUnfolderBase]: For 11389/11389 co-relation queries the response was YES. [2024-05-12 12:22:30,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 1460 events. 816/1460 cut-off events. For 11389/11389 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7747 event pairs, 132 based on Foata normal form. 2/1423 useless extension candidates. Maximal degree in co-relation 7561. Up to 1220 conditions per place. [2024-05-12 12:22:30,267 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 154 selfloop transitions, 28 changer transitions 0/188 dead transitions. [2024-05-12 12:22:30,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 188 transitions, 2298 flow [2024-05-12 12:22:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 12:22:30,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-05-12 12:22:30,279 INFO L175 Difference]: Start difference. First operand has 119 places, 157 transitions, 1803 flow. Second operand 8 states and 134 transitions. [2024-05-12 12:22:30,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 188 transitions, 2298 flow [2024-05-12 12:22:30,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 188 transitions, 2193 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-05-12 12:22:30,306 INFO L231 Difference]: Finished difference. Result has 121 places, 162 transitions, 1823 flow [2024-05-12 12:22:30,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1823, PETRI_PLACES=121, PETRI_TRANSITIONS=162} [2024-05-12 12:22:30,306 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2024-05-12 12:22:30,306 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 162 transitions, 1823 flow [2024-05-12 12:22:30,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:30,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:30,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:30,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:22:30,308 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:30,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1448934385, now seen corresponding path program 2 times [2024-05-12 12:22:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:30,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413374139] [2024-05-12 12:22:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:33,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:33,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413374139] [2024-05-12 12:22:33,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413374139] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:33,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:33,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806940423] [2024-05-12 12:22:33,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:33,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:33,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 162 transitions, 1823 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:33,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:33,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:33,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:34,026 INFO L124 PetriNetUnfolderBase]: 831/1488 cut-off events. [2024-05-12 12:22:34,027 INFO L125 PetriNetUnfolderBase]: For 12577/12577 co-relation queries the response was YES. [2024-05-12 12:22:34,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7841 conditions, 1488 events. 831/1488 cut-off events. For 12577/12577 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8030 event pairs, 168 based on Foata normal form. 2/1450 useless extension candidates. Maximal degree in co-relation 7781. Up to 1247 conditions per place. [2024-05-12 12:22:34,038 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 152 selfloop transitions, 33 changer transitions 0/191 dead transitions. [2024-05-12 12:22:34,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 191 transitions, 2326 flow [2024-05-12 12:22:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-05-12 12:22:34,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756944444444444 [2024-05-12 12:22:34,049 INFO L175 Difference]: Start difference. First operand has 121 places, 162 transitions, 1823 flow. Second operand 8 states and 137 transitions. [2024-05-12 12:22:34,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 191 transitions, 2326 flow [2024-05-12 12:22:34,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 191 transitions, 2245 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-05-12 12:22:34,075 INFO L231 Difference]: Finished difference. Result has 124 places, 164 transitions, 1852 flow [2024-05-12 12:22:34,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1852, PETRI_PLACES=124, PETRI_TRANSITIONS=164} [2024-05-12 12:22:34,076 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 84 predicate places. [2024-05-12 12:22:34,076 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 164 transitions, 1852 flow [2024-05-12 12:22:34,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:34,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:34,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:34,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:22:34,077 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:34,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash -189740208, now seen corresponding path program 1 times [2024-05-12 12:22:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:34,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866336391] [2024-05-12 12:22:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:37,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866336391] [2024-05-12 12:22:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866336391] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:37,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003809608] [2024-05-12 12:22:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:37,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:37,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:37,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:37,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:37,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 164 transitions, 1852 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:37,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:37,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:37,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:37,827 INFO L124 PetriNetUnfolderBase]: 828/1473 cut-off events. [2024-05-12 12:22:37,827 INFO L125 PetriNetUnfolderBase]: For 12886/12886 co-relation queries the response was YES. [2024-05-12 12:22:37,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7794 conditions, 1473 events. 828/1473 cut-off events. For 12886/12886 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7852 event pairs, 166 based on Foata normal form. 1/1435 useless extension candidates. Maximal degree in co-relation 7733. Up to 1226 conditions per place. [2024-05-12 12:22:37,838 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 151 selfloop transitions, 37 changer transitions 0/194 dead transitions. [2024-05-12 12:22:37,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 194 transitions, 2381 flow [2024-05-12 12:22:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-05-12 12:22:37,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-05-12 12:22:37,840 INFO L175 Difference]: Start difference. First operand has 124 places, 164 transitions, 1852 flow. Second operand 8 states and 138 transitions. [2024-05-12 12:22:37,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 194 transitions, 2381 flow [2024-05-12 12:22:37,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 194 transitions, 2261 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:37,867 INFO L231 Difference]: Finished difference. Result has 126 places, 167 transitions, 1874 flow [2024-05-12 12:22:37,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1874, PETRI_PLACES=126, PETRI_TRANSITIONS=167} [2024-05-12 12:22:37,868 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 86 predicate places. [2024-05-12 12:22:37,868 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 167 transitions, 1874 flow [2024-05-12 12:22:37,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:37,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:37,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:37,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:22:37,869 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:37,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1329924145, now seen corresponding path program 3 times [2024-05-12 12:22:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:37,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830097018] [2024-05-12 12:22:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:40,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830097018] [2024-05-12 12:22:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830097018] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416631299] [2024-05-12 12:22:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:40,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:40,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:40,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:40,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 167 transitions, 1874 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:40,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:40,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:40,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:41,200 INFO L124 PetriNetUnfolderBase]: 843/1501 cut-off events. [2024-05-12 12:22:41,200 INFO L125 PetriNetUnfolderBase]: For 13701/13701 co-relation queries the response was YES. [2024-05-12 12:22:41,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7916 conditions, 1501 events. 843/1501 cut-off events. For 13701/13701 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8066 event pairs, 157 based on Foata normal form. 2/1463 useless extension candidates. Maximal degree in co-relation 7854. Up to 1221 conditions per place. [2024-05-12 12:22:41,210 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 151 selfloop transitions, 39 changer transitions 0/196 dead transitions. [2024-05-12 12:22:41,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 196 transitions, 2401 flow [2024-05-12 12:22:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-05-12 12:22:41,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-05-12 12:22:41,216 INFO L175 Difference]: Start difference. First operand has 126 places, 167 transitions, 1874 flow. Second operand 8 states and 135 transitions. [2024-05-12 12:22:41,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 196 transitions, 2401 flow [2024-05-12 12:22:41,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 196 transitions, 2319 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:41,248 INFO L231 Difference]: Finished difference. Result has 128 places, 169 transitions, 1917 flow [2024-05-12 12:22:41,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1917, PETRI_PLACES=128, PETRI_TRANSITIONS=169} [2024-05-12 12:22:41,248 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2024-05-12 12:22:41,249 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 169 transitions, 1917 flow [2024-05-12 12:22:41,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:41,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:41,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:41,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:22:41,249 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:41,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1752732344, now seen corresponding path program 1 times [2024-05-12 12:22:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61515037] [2024-05-12 12:22:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61515037] [2024-05-12 12:22:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61515037] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:44,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607340703] [2024-05-12 12:22:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:44,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:44,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:44,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:44,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:44,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:44,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 169 transitions, 1917 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:44,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:44,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:44,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:45,244 INFO L124 PetriNetUnfolderBase]: 862/1538 cut-off events. [2024-05-12 12:22:45,244 INFO L125 PetriNetUnfolderBase]: For 14588/14600 co-relation queries the response was YES. [2024-05-12 12:22:45,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8199 conditions, 1538 events. 862/1538 cut-off events. For 14588/14600 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8295 event pairs, 150 based on Foata normal form. 14/1511 useless extension candidates. Maximal degree in co-relation 8136. Up to 1220 conditions per place. [2024-05-12 12:22:45,254 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 159 selfloop transitions, 42 changer transitions 0/207 dead transitions. [2024-05-12 12:22:45,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 207 transitions, 2553 flow [2024-05-12 12:22:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 12:22:45,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-05-12 12:22:45,255 INFO L175 Difference]: Start difference. First operand has 128 places, 169 transitions, 1917 flow. Second operand 9 states and 151 transitions. [2024-05-12 12:22:45,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 207 transitions, 2553 flow [2024-05-12 12:22:45,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 207 transitions, 2442 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:45,285 INFO L231 Difference]: Finished difference. Result has 131 places, 171 transitions, 1942 flow [2024-05-12 12:22:45,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1942, PETRI_PLACES=131, PETRI_TRANSITIONS=171} [2024-05-12 12:22:45,285 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 91 predicate places. [2024-05-12 12:22:45,286 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 171 transitions, 1942 flow [2024-05-12 12:22:45,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:45,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:45,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:45,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:22:45,286 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:45,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1752405914, now seen corresponding path program 2 times [2024-05-12 12:22:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:45,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690160276] [2024-05-12 12:22:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:48,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:48,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690160276] [2024-05-12 12:22:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690160276] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857336357] [2024-05-12 12:22:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:48,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:48,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:48,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:48,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:48,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 171 transitions, 1942 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:48,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:48,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:48,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:49,152 INFO L124 PetriNetUnfolderBase]: 940/1673 cut-off events. [2024-05-12 12:22:49,153 INFO L125 PetriNetUnfolderBase]: For 17931/17933 co-relation queries the response was YES. [2024-05-12 12:22:49,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8933 conditions, 1673 events. 940/1673 cut-off events. For 17931/17933 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9153 event pairs, 147 based on Foata normal form. 2/1636 useless extension candidates. Maximal degree in co-relation 8869. Up to 766 conditions per place. [2024-05-12 12:22:49,165 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 131 selfloop transitions, 72 changer transitions 0/209 dead transitions. [2024-05-12 12:22:49,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 209 transitions, 2704 flow [2024-05-12 12:22:49,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-05-12 12:22:49,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 12:22:49,167 INFO L175 Difference]: Start difference. First operand has 131 places, 171 transitions, 1942 flow. Second operand 8 states and 144 transitions. [2024-05-12 12:22:49,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 209 transitions, 2704 flow [2024-05-12 12:22:49,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 209 transitions, 2569 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-05-12 12:22:49,203 INFO L231 Difference]: Finished difference. Result has 134 places, 177 transitions, 2126 flow [2024-05-12 12:22:49,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2126, PETRI_PLACES=134, PETRI_TRANSITIONS=177} [2024-05-12 12:22:49,204 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2024-05-12 12:22:49,204 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 177 transitions, 2126 flow [2024-05-12 12:22:49,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:49,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:49,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:49,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:22:49,205 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:49,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1761936833, now seen corresponding path program 1 times [2024-05-12 12:22:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217072988] [2024-05-12 12:22:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:52,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:52,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217072988] [2024-05-12 12:22:52,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217072988] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:52,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:52,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597377631] [2024-05-12 12:22:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:52,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:52,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:52,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 177 transitions, 2126 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:52,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:52,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:52,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:52,672 INFO L124 PetriNetUnfolderBase]: 948/1691 cut-off events. [2024-05-12 12:22:52,673 INFO L125 PetriNetUnfolderBase]: For 18718/18720 co-relation queries the response was YES. [2024-05-12 12:22:52,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9218 conditions, 1691 events. 948/1691 cut-off events. For 18718/18720 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9375 event pairs, 171 based on Foata normal form. 2/1652 useless extension candidates. Maximal degree in co-relation 9151. Up to 1204 conditions per place. [2024-05-12 12:22:52,684 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 135 selfloop transitions, 63 changer transitions 0/204 dead transitions. [2024-05-12 12:22:52,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 204 transitions, 2700 flow [2024-05-12 12:22:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-05-12 12:22:52,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-05-12 12:22:52,685 INFO L175 Difference]: Start difference. First operand has 134 places, 177 transitions, 2126 flow. Second operand 7 states and 124 transitions. [2024-05-12 12:22:52,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 204 transitions, 2700 flow [2024-05-12 12:22:52,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 204 transitions, 2546 flow, removed 48 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:52,732 INFO L231 Difference]: Finished difference. Result has 138 places, 183 transitions, 2210 flow [2024-05-12 12:22:52,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2210, PETRI_PLACES=138, PETRI_TRANSITIONS=183} [2024-05-12 12:22:52,733 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2024-05-12 12:22:52,733 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 183 transitions, 2210 flow [2024-05-12 12:22:52,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:52,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:52,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:52,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:22:52,734 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:52,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2018645105, now seen corresponding path program 4 times [2024-05-12 12:22:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469100001] [2024-05-12 12:22:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:56,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469100001] [2024-05-12 12:22:56,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469100001] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:56,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:56,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333737129] [2024-05-12 12:22:56,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:56,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:56,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:56,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:56,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 183 transitions, 2210 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:56,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:56,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:56,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:56,654 INFO L124 PetriNetUnfolderBase]: 1028/1821 cut-off events. [2024-05-12 12:22:56,654 INFO L125 PetriNetUnfolderBase]: For 23116/23116 co-relation queries the response was YES. [2024-05-12 12:22:56,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9878 conditions, 1821 events. 1028/1821 cut-off events. For 23116/23116 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10226 event pairs, 172 based on Foata normal form. 14/1796 useless extension candidates. Maximal degree in co-relation 9809. Up to 1064 conditions per place. [2024-05-12 12:22:56,667 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 135 selfloop transitions, 81 changer transitions 0/222 dead transitions. [2024-05-12 12:22:56,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 222 transitions, 2853 flow [2024-05-12 12:22:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 12:22:56,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2024-05-12 12:22:56,670 INFO L175 Difference]: Start difference. First operand has 138 places, 183 transitions, 2210 flow. Second operand 9 states and 164 transitions. [2024-05-12 12:22:56,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 222 transitions, 2853 flow [2024-05-12 12:22:56,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 222 transitions, 2742 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 12:22:56,722 INFO L231 Difference]: Finished difference. Result has 143 places, 186 transitions, 2329 flow [2024-05-12 12:22:56,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2329, PETRI_PLACES=143, PETRI_TRANSITIONS=186} [2024-05-12 12:22:56,726 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2024-05-12 12:22:56,726 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 186 transitions, 2329 flow [2024-05-12 12:22:56,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:56,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:56,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:56,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:22:56,727 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:56,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash 852509639, now seen corresponding path program 1 times [2024-05-12 12:22:56,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:56,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472115012] [2024-05-12 12:22:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:57,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:57,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472115012] [2024-05-12 12:22:57,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472115012] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:57,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:57,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:22:57,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673248592] [2024-05-12 12:22:57,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:57,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:22:57,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:57,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:22:57,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:22:57,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:22:57,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 186 transitions, 2329 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:57,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:57,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:22:57,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:57,632 INFO L124 PetriNetUnfolderBase]: 1018/1928 cut-off events. [2024-05-12 12:22:57,633 INFO L125 PetriNetUnfolderBase]: For 20012/20073 co-relation queries the response was YES. [2024-05-12 12:22:57,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10320 conditions, 1928 events. 1018/1928 cut-off events. For 20012/20073 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12182 event pairs, 144 based on Foata normal form. 18/1871 useless extension candidates. Maximal degree in co-relation 10250. Up to 984 conditions per place. [2024-05-12 12:22:57,645 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 112 selfloop transitions, 45 changer transitions 60/282 dead transitions. [2024-05-12 12:22:57,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 282 transitions, 3627 flow [2024-05-12 12:22:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:22:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:22:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-05-12 12:22:57,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393518518518519 [2024-05-12 12:22:57,646 INFO L175 Difference]: Start difference. First operand has 143 places, 186 transitions, 2329 flow. Second operand 12 states and 233 transitions. [2024-05-12 12:22:57,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 282 transitions, 3627 flow [2024-05-12 12:22:57,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 282 transitions, 3423 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-05-12 12:22:57,701 INFO L231 Difference]: Finished difference. Result has 155 places, 199 transitions, 2505 flow [2024-05-12 12:22:57,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2137, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2505, PETRI_PLACES=155, PETRI_TRANSITIONS=199} [2024-05-12 12:22:57,702 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 115 predicate places. [2024-05-12 12:22:57,702 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 199 transitions, 2505 flow [2024-05-12 12:22:57,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:57,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:57,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:57,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:22:57,703 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:57,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:57,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1588886102, now seen corresponding path program 1 times [2024-05-12 12:22:57,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:57,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528816196] [2024-05-12 12:22:57,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:57,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:00,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528816196] [2024-05-12 12:23:00,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528816196] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:00,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:00,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:00,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134324898] [2024-05-12 12:23:00,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:00,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:00,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:01,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:01,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 199 transitions, 2505 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:01,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:01,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:01,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:01,760 INFO L124 PetriNetUnfolderBase]: 1132/1983 cut-off events. [2024-05-12 12:23:01,761 INFO L125 PetriNetUnfolderBase]: For 24840/24840 co-relation queries the response was YES. [2024-05-12 12:23:01,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11933 conditions, 1983 events. 1132/1983 cut-off events. For 24840/24840 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11073 event pairs, 203 based on Foata normal form. 2/1985 useless extension candidates. Maximal degree in co-relation 11856. Up to 1715 conditions per place. [2024-05-12 12:23:01,777 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 198 selfloop transitions, 32 changer transitions 0/237 dead transitions. [2024-05-12 12:23:01,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 237 transitions, 3169 flow [2024-05-12 12:23:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-05-12 12:23:01,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-05-12 12:23:01,779 INFO L175 Difference]: Start difference. First operand has 155 places, 199 transitions, 2505 flow. Second operand 9 states and 150 transitions. [2024-05-12 12:23:01,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 237 transitions, 3169 flow [2024-05-12 12:23:01,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 237 transitions, 3103 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:01,852 INFO L231 Difference]: Finished difference. Result has 154 places, 206 transitions, 2625 flow [2024-05-12 12:23:01,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2625, PETRI_PLACES=154, PETRI_TRANSITIONS=206} [2024-05-12 12:23:01,853 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 114 predicate places. [2024-05-12 12:23:01,853 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 206 transitions, 2625 flow [2024-05-12 12:23:01,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:01,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:01,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:01,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:23:01,854 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:01,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1967287690, now seen corresponding path program 2 times [2024-05-12 12:23:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:01,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729016963] [2024-05-12 12:23:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:04,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:04,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729016963] [2024-05-12 12:23:04,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729016963] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:04,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:04,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824607945] [2024-05-12 12:23:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:04,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:04,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:04,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:04,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:05,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:05,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 206 transitions, 2625 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:05,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:05,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:05,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:05,704 INFO L124 PetriNetUnfolderBase]: 1160/2034 cut-off events. [2024-05-12 12:23:05,704 INFO L125 PetriNetUnfolderBase]: For 26950/26950 co-relation queries the response was YES. [2024-05-12 12:23:05,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12156 conditions, 2034 events. 1160/2034 cut-off events. For 26950/26950 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11545 event pairs, 250 based on Foata normal form. 4/2038 useless extension candidates. Maximal degree in co-relation 12079. Up to 1732 conditions per place. [2024-05-12 12:23:05,720 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 196 selfloop transitions, 41 changer transitions 0/244 dead transitions. [2024-05-12 12:23:05,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 244 transitions, 3332 flow [2024-05-12 12:23:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-05-12 12:23:05,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-05-12 12:23:05,722 INFO L175 Difference]: Start difference. First operand has 154 places, 206 transitions, 2625 flow. Second operand 9 states and 152 transitions. [2024-05-12 12:23:05,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 244 transitions, 3332 flow [2024-05-12 12:23:05,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 244 transitions, 3234 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:05,806 INFO L231 Difference]: Finished difference. Result has 158 places, 209 transitions, 2687 flow [2024-05-12 12:23:05,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2527, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2687, PETRI_PLACES=158, PETRI_TRANSITIONS=209} [2024-05-12 12:23:05,807 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 118 predicate places. [2024-05-12 12:23:05,808 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 209 transitions, 2687 flow [2024-05-12 12:23:05,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:05,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:05,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:05,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:23:05,809 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:05,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1967292340, now seen corresponding path program 3 times [2024-05-12 12:23:05,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782499069] [2024-05-12 12:23:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782499069] [2024-05-12 12:23:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782499069] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:08,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791397047] [2024-05-12 12:23:08,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:08,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:08,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:08,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:08,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:08,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 209 transitions, 2687 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:08,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:08,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:08,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:09,602 INFO L124 PetriNetUnfolderBase]: 1183/2076 cut-off events. [2024-05-12 12:23:09,602 INFO L125 PetriNetUnfolderBase]: For 29240/29252 co-relation queries the response was YES. [2024-05-12 12:23:09,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12606 conditions, 2076 events. 1183/2076 cut-off events. For 29240/29252 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11849 event pairs, 250 based on Foata normal form. 14/2090 useless extension candidates. Maximal degree in co-relation 12528. Up to 1712 conditions per place. [2024-05-12 12:23:09,616 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 193 selfloop transitions, 50 changer transitions 0/250 dead transitions. [2024-05-12 12:23:09,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 250 transitions, 3552 flow [2024-05-12 12:23:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-05-12 12:23:09,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-05-12 12:23:09,618 INFO L175 Difference]: Start difference. First operand has 158 places, 209 transitions, 2687 flow. Second operand 8 states and 135 transitions. [2024-05-12 12:23:09,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 250 transitions, 3552 flow [2024-05-12 12:23:09,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 250 transitions, 3423 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-05-12 12:23:09,701 INFO L231 Difference]: Finished difference. Result has 161 places, 219 transitions, 2939 flow [2024-05-12 12:23:09,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2939, PETRI_PLACES=161, PETRI_TRANSITIONS=219} [2024-05-12 12:23:09,701 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 121 predicate places. [2024-05-12 12:23:09,702 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 219 transitions, 2939 flow [2024-05-12 12:23:09,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:09,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:09,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:09,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:23:09,702 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:09,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1336713864, now seen corresponding path program 1 times [2024-05-12 12:23:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215097183] [2024-05-12 12:23:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215097183] [2024-05-12 12:23:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215097183] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531861503] [2024-05-12 12:23:12,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:12,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:12,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:12,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 219 transitions, 2939 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:12,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:12,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:12,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:13,607 INFO L124 PetriNetUnfolderBase]: 1330/2340 cut-off events. [2024-05-12 12:23:13,607 INFO L125 PetriNetUnfolderBase]: For 41480/41482 co-relation queries the response was YES. [2024-05-12 12:23:13,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14405 conditions, 2340 events. 1330/2340 cut-off events. For 41480/41482 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 13794 event pairs, 208 based on Foata normal form. 8/2348 useless extension candidates. Maximal degree in co-relation 14324. Up to 1163 conditions per place. [2024-05-12 12:23:13,626 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 171 selfloop transitions, 83 changer transitions 0/261 dead transitions. [2024-05-12 12:23:13,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 261 transitions, 3866 flow [2024-05-12 12:23:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-05-12 12:23:13,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-05-12 12:23:13,629 INFO L175 Difference]: Start difference. First operand has 161 places, 219 transitions, 2939 flow. Second operand 8 states and 148 transitions. [2024-05-12 12:23:13,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 261 transitions, 3866 flow [2024-05-12 12:23:13,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 261 transitions, 3676 flow, removed 83 selfloop flow, removed 3 redundant places. [2024-05-12 12:23:13,733 INFO L231 Difference]: Finished difference. Result has 167 places, 222 transitions, 3042 flow [2024-05-12 12:23:13,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2773, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3042, PETRI_PLACES=167, PETRI_TRANSITIONS=222} [2024-05-12 12:23:13,734 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 127 predicate places. [2024-05-12 12:23:13,734 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 222 transitions, 3042 flow [2024-05-12 12:23:13,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:13,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:13,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:13,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:23:13,735 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:13,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1305623584, now seen corresponding path program 2 times [2024-05-12 12:23:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015640162] [2024-05-12 12:23:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015640162] [2024-05-12 12:23:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015640162] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:16,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:16,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:16,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970195319] [2024-05-12 12:23:16,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:16,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:16,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:16,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:17,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:17,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 222 transitions, 3042 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:17,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:17,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:17,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:17,840 INFO L124 PetriNetUnfolderBase]: 1374/2420 cut-off events. [2024-05-12 12:23:17,841 INFO L125 PetriNetUnfolderBase]: For 45078/45080 co-relation queries the response was YES. [2024-05-12 12:23:17,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15015 conditions, 2420 events. 1374/2420 cut-off events. For 45078/45080 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14531 event pairs, 247 based on Foata normal form. 12/2432 useless extension candidates. Maximal degree in co-relation 14931. Up to 1707 conditions per place. [2024-05-12 12:23:17,861 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 175 selfloop transitions, 86 changer transitions 0/268 dead transitions. [2024-05-12 12:23:17,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 268 transitions, 3897 flow [2024-05-12 12:23:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:23:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:23:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-05-12 12:23:17,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-05-12 12:23:17,863 INFO L175 Difference]: Start difference. First operand has 167 places, 222 transitions, 3042 flow. Second operand 10 states and 176 transitions. [2024-05-12 12:23:17,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 268 transitions, 3897 flow [2024-05-12 12:23:17,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 268 transitions, 3772 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 12:23:17,978 INFO L231 Difference]: Finished difference. Result has 173 places, 224 transitions, 3161 flow [2024-05-12 12:23:17,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2917, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3161, PETRI_PLACES=173, PETRI_TRANSITIONS=224} [2024-05-12 12:23:17,979 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2024-05-12 12:23:17,979 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 224 transitions, 3161 flow [2024-05-12 12:23:17,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:17,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:17,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:17,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:23:17,980 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:17,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1312290258, now seen corresponding path program 4 times [2024-05-12 12:23:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:17,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372588932] [2024-05-12 12:23:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:20,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372588932] [2024-05-12 12:23:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372588932] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:20,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:20,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782846803] [2024-05-12 12:23:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:20,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:20,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:20,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:21,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:21,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 224 transitions, 3161 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:21,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:21,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:21,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:21,784 INFO L124 PetriNetUnfolderBase]: 1368/2410 cut-off events. [2024-05-12 12:23:21,784 INFO L125 PetriNetUnfolderBase]: For 40730/40732 co-relation queries the response was YES. [2024-05-12 12:23:21,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15094 conditions, 2410 events. 1368/2410 cut-off events. For 40730/40732 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14482 event pairs, 237 based on Foata normal form. 4/2414 useless extension candidates. Maximal degree in co-relation 15008. Up to 1731 conditions per place. [2024-05-12 12:23:21,807 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 170 selfloop transitions, 83 changer transitions 0/260 dead transitions. [2024-05-12 12:23:21,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 260 transitions, 3938 flow [2024-05-12 12:23:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-05-12 12:23:21,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-05-12 12:23:21,809 INFO L175 Difference]: Start difference. First operand has 173 places, 224 transitions, 3161 flow. Second operand 8 states and 139 transitions. [2024-05-12 12:23:21,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 260 transitions, 3938 flow [2024-05-12 12:23:21,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 260 transitions, 3683 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-05-12 12:23:21,931 INFO L231 Difference]: Finished difference. Result has 173 places, 227 transitions, 3168 flow [2024-05-12 12:23:21,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2906, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3168, PETRI_PLACES=173, PETRI_TRANSITIONS=227} [2024-05-12 12:23:21,932 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2024-05-12 12:23:21,932 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 227 transitions, 3168 flow [2024-05-12 12:23:21,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:21,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:21,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:21,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:23:21,933 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:21,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1330034170, now seen corresponding path program 5 times [2024-05-12 12:23:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:21,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480663518] [2024-05-12 12:23:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:21,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:25,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480663518] [2024-05-12 12:23:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480663518] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:25,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:25,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111344789] [2024-05-12 12:23:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:25,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:25,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:25,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 227 transitions, 3168 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:25,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:25,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:25,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:25,978 INFO L124 PetriNetUnfolderBase]: 1366/2408 cut-off events. [2024-05-12 12:23:25,978 INFO L125 PetriNetUnfolderBase]: For 37963/37965 co-relation queries the response was YES. [2024-05-12 12:23:25,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14842 conditions, 2408 events. 1366/2408 cut-off events. For 37963/37965 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14434 event pairs, 232 based on Foata normal form. 2/2410 useless extension candidates. Maximal degree in co-relation 14755. Up to 1383 conditions per place. [2024-05-12 12:23:26,000 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 167 selfloop transitions, 91 changer transitions 0/265 dead transitions. [2024-05-12 12:23:26,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 265 transitions, 3959 flow [2024-05-12 12:23:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-05-12 12:23:26,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-05-12 12:23:26,002 INFO L175 Difference]: Start difference. First operand has 173 places, 227 transitions, 3168 flow. Second operand 8 states and 143 transitions. [2024-05-12 12:23:26,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 265 transitions, 3959 flow [2024-05-12 12:23:26,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 265 transitions, 3721 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:26,143 INFO L231 Difference]: Finished difference. Result has 175 places, 230 transitions, 3210 flow [2024-05-12 12:23:26,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2934, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3210, PETRI_PLACES=175, PETRI_TRANSITIONS=230} [2024-05-12 12:23:26,143 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 135 predicate places. [2024-05-12 12:23:26,144 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 230 transitions, 3210 flow [2024-05-12 12:23:26,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:26,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:26,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:26,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:23:26,144 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:26,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1166157078, now seen corresponding path program 3 times [2024-05-12 12:23:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:26,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436577924] [2024-05-12 12:23:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436577924] [2024-05-12 12:23:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436577924] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908183177] [2024-05-12 12:23:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:29,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:29,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:29,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:29,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 230 transitions, 3210 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:29,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:29,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:29,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:30,202 INFO L124 PetriNetUnfolderBase]: 1458/2572 cut-off events. [2024-05-12 12:23:30,202 INFO L125 PetriNetUnfolderBase]: For 46547/46547 co-relation queries the response was YES. [2024-05-12 12:23:30,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15744 conditions, 2572 events. 1458/2572 cut-off events. For 46547/46547 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15663 event pairs, 248 based on Foata normal form. 8/2580 useless extension candidates. Maximal degree in co-relation 15656. Up to 1198 conditions per place. [2024-05-12 12:23:30,222 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 186 selfloop transitions, 82 changer transitions 0/275 dead transitions. [2024-05-12 12:23:30,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 275 transitions, 4114 flow [2024-05-12 12:23:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 12:23:30,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-05-12 12:23:30,224 INFO L175 Difference]: Start difference. First operand has 175 places, 230 transitions, 3210 flow. Second operand 9 states and 161 transitions. [2024-05-12 12:23:30,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 275 transitions, 4114 flow [2024-05-12 12:23:30,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 275 transitions, 3869 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:30,365 INFO L231 Difference]: Finished difference. Result has 178 places, 232 transitions, 3211 flow [2024-05-12 12:23:30,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2965, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3211, PETRI_PLACES=178, PETRI_TRANSITIONS=232} [2024-05-12 12:23:30,366 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2024-05-12 12:23:30,366 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 232 transitions, 3211 flow [2024-05-12 12:23:30,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:30,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:30,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:30,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:23:30,367 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:30,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1176276408, now seen corresponding path program 4 times [2024-05-12 12:23:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444869768] [2024-05-12 12:23:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444869768] [2024-05-12 12:23:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444869768] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:33,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757171901] [2024-05-12 12:23:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:33,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:33,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:33,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:33,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:33,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 232 transitions, 3211 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:33,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:33,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:33,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:34,502 INFO L124 PetriNetUnfolderBase]: 1514/2680 cut-off events. [2024-05-12 12:23:34,503 INFO L125 PetriNetUnfolderBase]: For 50421/50421 co-relation queries the response was YES. [2024-05-12 12:23:34,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16202 conditions, 2680 events. 1514/2680 cut-off events. For 50421/50421 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 16661 event pairs, 278 based on Foata normal form. 8/2688 useless extension candidates. Maximal degree in co-relation 16113. Up to 1540 conditions per place. [2024-05-12 12:23:34,523 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 189 selfloop transitions, 80 changer transitions 0/276 dead transitions. [2024-05-12 12:23:34,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 276 transitions, 4128 flow [2024-05-12 12:23:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 12:23:34,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2024-05-12 12:23:34,525 INFO L175 Difference]: Start difference. First operand has 178 places, 232 transitions, 3211 flow. Second operand 9 states and 164 transitions. [2024-05-12 12:23:34,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 276 transitions, 4128 flow [2024-05-12 12:23:34,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 276 transitions, 4022 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:34,667 INFO L231 Difference]: Finished difference. Result has 182 places, 234 transitions, 3352 flow [2024-05-12 12:23:34,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3352, PETRI_PLACES=182, PETRI_TRANSITIONS=234} [2024-05-12 12:23:34,668 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 142 predicate places. [2024-05-12 12:23:34,668 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 234 transitions, 3352 flow [2024-05-12 12:23:34,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:34,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:34,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:34,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:23:34,669 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:34,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:34,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1461615288, now seen corresponding path program 5 times [2024-05-12 12:23:34,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:34,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760464645] [2024-05-12 12:23:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:34,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:38,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760464645] [2024-05-12 12:23:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760464645] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:38,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:38,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767193318] [2024-05-12 12:23:38,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:38,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:38,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:38,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:38,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:38,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 234 transitions, 3352 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:38,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:38,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:38,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:39,202 INFO L124 PetriNetUnfolderBase]: 1519/2687 cut-off events. [2024-05-12 12:23:39,203 INFO L125 PetriNetUnfolderBase]: For 46588/46588 co-relation queries the response was YES. [2024-05-12 12:23:39,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16172 conditions, 2687 events. 1519/2687 cut-off events. For 46588/46588 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 16767 event pairs, 292 based on Foata normal form. 10/2697 useless extension candidates. Maximal degree in co-relation 16081. Up to 2049 conditions per place. [2024-05-12 12:23:39,225 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 194 selfloop transitions, 79 changer transitions 0/280 dead transitions. [2024-05-12 12:23:39,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 280 transitions, 4205 flow [2024-05-12 12:23:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:23:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:23:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-05-12 12:23:39,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-05-12 12:23:39,226 INFO L175 Difference]: Start difference. First operand has 182 places, 234 transitions, 3352 flow. Second operand 10 states and 174 transitions. [2024-05-12 12:23:39,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 280 transitions, 4205 flow [2024-05-12 12:23:39,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 280 transitions, 4056 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:39,365 INFO L231 Difference]: Finished difference. Result has 187 places, 238 transitions, 3448 flow [2024-05-12 12:23:39,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3215, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3448, PETRI_PLACES=187, PETRI_TRANSITIONS=238} [2024-05-12 12:23:39,366 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 147 predicate places. [2024-05-12 12:23:39,367 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 238 transitions, 3448 flow [2024-05-12 12:23:39,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-05-12 12:23:39,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:39,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:39,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:23:39,367 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:39,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2010828240, now seen corresponding path program 1 times [2024-05-12 12:23:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870414340] [2024-05-12 12:23:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870414340] [2024-05-12 12:23:42,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870414340] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:42,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:42,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009221354] [2024-05-12 12:23:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:42,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:42,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:42,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:42,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:42,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:42,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 238 transitions, 3448 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:42,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:42,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:42,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:43,481 INFO L124 PetriNetUnfolderBase]: 1512/2674 cut-off events. [2024-05-12 12:23:43,481 INFO L125 PetriNetUnfolderBase]: For 40168/40168 co-relation queries the response was YES. [2024-05-12 12:23:43,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16050 conditions, 2674 events. 1512/2674 cut-off events. For 40168/40168 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 16537 event pairs, 372 based on Foata normal form. 6/2680 useless extension candidates. Maximal degree in co-relation 15957. Up to 2314 conditions per place. [2024-05-12 12:23:43,503 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 231 selfloop transitions, 36 changer transitions 0/274 dead transitions. [2024-05-12 12:23:43,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 274 transitions, 4198 flow [2024-05-12 12:23:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-05-12 12:23:43,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2024-05-12 12:23:43,505 INFO L175 Difference]: Start difference. First operand has 187 places, 238 transitions, 3448 flow. Second operand 9 states and 147 transitions. [2024-05-12 12:23:43,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 274 transitions, 4198 flow [2024-05-12 12:23:43,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 274 transitions, 4005 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-05-12 12:23:43,651 INFO L231 Difference]: Finished difference. Result has 190 places, 241 transitions, 3439 flow [2024-05-12 12:23:43,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3255, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3439, PETRI_PLACES=190, PETRI_TRANSITIONS=241} [2024-05-12 12:23:43,652 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 150 predicate places. [2024-05-12 12:23:43,652 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 241 transitions, 3439 flow [2024-05-12 12:23:43,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:43,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:43,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:43,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:23:43,652 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:43,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash -856375580, now seen corresponding path program 2 times [2024-05-12 12:23:43,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:43,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191485527] [2024-05-12 12:23:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191485527] [2024-05-12 12:23:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191485527] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:47,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:47,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89782322] [2024-05-12 12:23:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:47,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:47,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:47,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 241 transitions, 3439 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:47,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:47,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:47,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:47,900 INFO L124 PetriNetUnfolderBase]: 1505/2661 cut-off events. [2024-05-12 12:23:47,900 INFO L125 PetriNetUnfolderBase]: For 35557/35557 co-relation queries the response was YES. [2024-05-12 12:23:47,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15603 conditions, 2661 events. 1505/2661 cut-off events. For 35557/35557 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 16561 event pairs, 271 based on Foata normal form. 6/2667 useless extension candidates. Maximal degree in co-relation 15508. Up to 1983 conditions per place. [2024-05-12 12:23:47,921 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 188 selfloop transitions, 84 changer transitions 0/279 dead transitions. [2024-05-12 12:23:47,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 279 transitions, 4190 flow [2024-05-12 12:23:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 12:23:47,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-05-12 12:23:47,923 INFO L175 Difference]: Start difference. First operand has 190 places, 241 transitions, 3439 flow. Second operand 9 states and 154 transitions. [2024-05-12 12:23:47,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 279 transitions, 4190 flow [2024-05-12 12:23:48,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 279 transitions, 3974 flow, removed 56 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:48,065 INFO L231 Difference]: Finished difference. Result has 194 places, 242 transitions, 3438 flow [2024-05-12 12:23:48,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3438, PETRI_PLACES=194, PETRI_TRANSITIONS=242} [2024-05-12 12:23:48,066 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2024-05-12 12:23:48,066 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 242 transitions, 3438 flow [2024-05-12 12:23:48,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:48,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:48,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:48,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:23:48,067 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:48,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:48,067 INFO L85 PathProgramCache]: Analyzing trace with hash -856519730, now seen corresponding path program 3 times [2024-05-12 12:23:48,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:48,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500512978] [2024-05-12 12:23:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:48,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:51,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:51,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500512978] [2024-05-12 12:23:51,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500512978] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:51,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:51,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:23:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705478322] [2024-05-12 12:23:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:51,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:23:51,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:51,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:23:51,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:23:51,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:51,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 242 transitions, 3438 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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-05-12 12:23:51,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:51,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:51,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:52,827 INFO L124 PetriNetUnfolderBase]: 1541/2730 cut-off events. [2024-05-12 12:23:52,827 INFO L125 PetriNetUnfolderBase]: For 37487/37499 co-relation queries the response was YES. [2024-05-12 12:23:52,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15933 conditions, 2730 events. 1541/2730 cut-off events. For 37487/37499 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17111 event pairs, 401 based on Foata normal form. 18/2748 useless extension candidates. Maximal degree in co-relation 15837. Up to 2309 conditions per place. [2024-05-12 12:23:52,850 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 231 selfloop transitions, 43 changer transitions 0/281 dead transitions. [2024-05-12 12:23:52,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 281 transitions, 4204 flow [2024-05-12 12:23:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-05-12 12:23:52,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 12:23:52,854 INFO L175 Difference]: Start difference. First operand has 194 places, 242 transitions, 3438 flow. Second operand 9 states and 153 transitions. [2024-05-12 12:23:52,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 281 transitions, 4204 flow [2024-05-12 12:23:52,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 281 transitions, 4011 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-05-12 12:23:52,976 INFO L231 Difference]: Finished difference. Result has 197 places, 244 transitions, 3393 flow [2024-05-12 12:23:52,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3245, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3393, PETRI_PLACES=197, PETRI_TRANSITIONS=244} [2024-05-12 12:23:52,976 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 157 predicate places. [2024-05-12 12:23:52,976 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 244 transitions, 3393 flow [2024-05-12 12:23:52,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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-05-12 12:23:52,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:52,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:52,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:23:52,977 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:52,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2026435818, now seen corresponding path program 4 times [2024-05-12 12:23:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:52,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185292020] [2024-05-12 12:23:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:56,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185292020] [2024-05-12 12:23:56,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185292020] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:56,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:56,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:56,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071735988] [2024-05-12 12:23:56,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:56,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:56,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:56,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:56,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 244 transitions, 3393 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:56,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:56,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:56,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:57,600 INFO L124 PetriNetUnfolderBase]: 1534/2716 cut-off events. [2024-05-12 12:23:57,600 INFO L125 PetriNetUnfolderBase]: For 32179/32179 co-relation queries the response was YES. [2024-05-12 12:23:57,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15445 conditions, 2716 events. 1534/2716 cut-off events. For 32179/32179 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17009 event pairs, 246 based on Foata normal form. 6/2722 useless extension candidates. Maximal degree in co-relation 15347. Up to 1867 conditions per place. [2024-05-12 12:23:57,622 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 188 selfloop transitions, 87 changer transitions 0/282 dead transitions. [2024-05-12 12:23:57,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 282 transitions, 4127 flow [2024-05-12 12:23:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-05-12 12:23:57,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-05-12 12:23:57,624 INFO L175 Difference]: Start difference. First operand has 197 places, 244 transitions, 3393 flow. Second operand 9 states and 152 transitions. [2024-05-12 12:23:57,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 282 transitions, 4127 flow [2024-05-12 12:23:57,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 282 transitions, 4016 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:57,747 INFO L231 Difference]: Finished difference. Result has 201 places, 245 transitions, 3512 flow [2024-05-12 12:23:57,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3282, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3512, PETRI_PLACES=201, PETRI_TRANSITIONS=245} [2024-05-12 12:23:57,748 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 161 predicate places. [2024-05-12 12:23:57,748 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 245 transitions, 3512 flow [2024-05-12 12:23:57,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:57,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:57,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:57,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:23:57,749 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:57,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 116808066, now seen corresponding path program 1 times [2024-05-12 12:23:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131792787] [2024-05-12 12:23:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:57,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131792787] [2024-05-12 12:23:58,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131792787] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:23:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393123647] [2024-05-12 12:23:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:58,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:23:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:23:58,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:23:58,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:23:58,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 245 transitions, 3512 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 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-05-12 12:23:58,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:58,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:23:58,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:58,763 INFO L124 PetriNetUnfolderBase]: 1293/2475 cut-off events. [2024-05-12 12:23:58,763 INFO L125 PetriNetUnfolderBase]: For 30127/30297 co-relation queries the response was YES. [2024-05-12 12:23:58,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14765 conditions, 2475 events. 1293/2475 cut-off events. For 30127/30297 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 16897 event pairs, 298 based on Foata normal form. 88/2470 useless extension candidates. Maximal degree in co-relation 14665. Up to 1726 conditions per place. [2024-05-12 12:23:58,787 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 178 selfloop transitions, 12 changer transitions 28/291 dead transitions. [2024-05-12 12:23:58,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 291 transitions, 4387 flow [2024-05-12 12:23:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 12:23:58,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-05-12 12:23:58,789 INFO L175 Difference]: Start difference. First operand has 201 places, 245 transitions, 3512 flow. Second operand 9 states and 167 transitions. [2024-05-12 12:23:58,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 291 transitions, 4387 flow [2024-05-12 12:23:58,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 291 transitions, 4056 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-05-12 12:23:58,907 INFO L231 Difference]: Finished difference. Result has 204 places, 242 transitions, 3189 flow [2024-05-12 12:23:58,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3181, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3189, PETRI_PLACES=204, PETRI_TRANSITIONS=242} [2024-05-12 12:23:58,908 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 164 predicate places. [2024-05-12 12:23:58,908 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 242 transitions, 3189 flow [2024-05-12 12:23:58,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 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-05-12 12:23:58,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:58,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:58,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:23:58,912 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:58,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1468440860, now seen corresponding path program 5 times [2024-05-12 12:23:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781802491] [2024-05-12 12:23:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:02,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-05-12 12:24:02,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781802491] [2024-05-12 12:24:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781802491] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:02,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:02,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768837534] [2024-05-12 12:24:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:02,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:02,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:02,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:02,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:02,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:24:02,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 242 transitions, 3189 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:02,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:02,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:24:02,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:03,379 INFO L124 PetriNetUnfolderBase]: 1517/2687 cut-off events. [2024-05-12 12:24:03,379 INFO L125 PetriNetUnfolderBase]: For 25029/25029 co-relation queries the response was YES. [2024-05-12 12:24:03,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14688 conditions, 2687 events. 1517/2687 cut-off events. For 25029/25029 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 16795 event pairs, 270 based on Foata normal form. 6/2693 useless extension candidates. Maximal degree in co-relation 14586. Up to 2118 conditions per place. [2024-05-12 12:24:03,405 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 201 selfloop transitions, 69 changer transitions 0/277 dead transitions. [2024-05-12 12:24:03,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 277 transitions, 3832 flow [2024-05-12 12:24:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-05-12 12:24:03,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-05-12 12:24:03,408 INFO L175 Difference]: Start difference. First operand has 204 places, 242 transitions, 3189 flow. Second operand 9 states and 154 transitions. [2024-05-12 12:24:03,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 277 transitions, 3832 flow [2024-05-12 12:24:03,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 277 transitions, 3669 flow, removed 28 selfloop flow, removed 20 redundant places. [2024-05-12 12:24:03,492 INFO L231 Difference]: Finished difference. Result has 187 places, 241 transitions, 3084 flow [2024-05-12 12:24:03,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3084, PETRI_PLACES=187, PETRI_TRANSITIONS=241} [2024-05-12 12:24:03,492 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 147 predicate places. [2024-05-12 12:24:03,492 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 241 transitions, 3084 flow [2024-05-12 12:24:03,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:03,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:03,493 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-05-12 12:24:03,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:24:03,493 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:03,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash -837533140, now seen corresponding path program 1 times [2024-05-12 12:24:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212891456] [2024-05-12 12:24:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:03,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212891456] [2024-05-12 12:24:03,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212891456] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:03,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:03,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68920295] [2024-05-12 12:24:03,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:03,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:03,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:03,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:03,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 241 transitions, 3084 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:03,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:03,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:03,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:04,565 INFO L124 PetriNetUnfolderBase]: 1260/2408 cut-off events. [2024-05-12 12:24:04,566 INFO L125 PetriNetUnfolderBase]: For 21190/21355 co-relation queries the response was YES. [2024-05-12 12:24:04,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13139 conditions, 2408 events. 1260/2408 cut-off events. For 21190/21355 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16388 event pairs, 267 based on Foata normal form. 86/2400 useless extension candidates. Maximal degree in co-relation 13054. Up to 1644 conditions per place. [2024-05-12 12:24:04,586 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 175 selfloop transitions, 24 changer transitions 31/302 dead transitions. [2024-05-12 12:24:04,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 302 transitions, 4048 flow [2024-05-12 12:24:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 12:24:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 12:24:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 229 transitions. [2024-05-12 12:24:04,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4893162393162393 [2024-05-12 12:24:04,587 INFO L175 Difference]: Start difference. First operand has 187 places, 241 transitions, 3084 flow. Second operand 13 states and 229 transitions. [2024-05-12 12:24:04,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 302 transitions, 4048 flow [2024-05-12 12:24:04,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 302 transitions, 3848 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-05-12 12:24:04,659 INFO L231 Difference]: Finished difference. Result has 199 places, 244 transitions, 3002 flow [2024-05-12 12:24:04,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3002, PETRI_PLACES=199, PETRI_TRANSITIONS=244} [2024-05-12 12:24:04,660 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 159 predicate places. [2024-05-12 12:24:04,660 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 244 transitions, 3002 flow [2024-05-12 12:24:04,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:04,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:04,660 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-05-12 12:24:04,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:24:04,660 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:04,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1396603712, now seen corresponding path program 1 times [2024-05-12 12:24:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:04,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381086593] [2024-05-12 12:24:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381086593] [2024-05-12 12:24:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381086593] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:04,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:24:04,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171656581] [2024-05-12 12:24:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:04,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:24:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:24:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:24:04,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:04,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 244 transitions, 3002 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 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-05-12 12:24:04,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:04,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:04,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:05,338 INFO L124 PetriNetUnfolderBase]: 1199/2391 cut-off events. [2024-05-12 12:24:05,338 INFO L125 PetriNetUnfolderBase]: For 24454/24587 co-relation queries the response was YES. [2024-05-12 12:24:05,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13497 conditions, 2391 events. 1199/2391 cut-off events. For 24454/24587 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16803 event pairs, 273 based on Foata normal form. 102/2427 useless extension candidates. Maximal degree in co-relation 13405. Up to 809 conditions per place. [2024-05-12 12:24:05,354 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 109 selfloop transitions, 21 changer transitions 107/289 dead transitions. [2024-05-12 12:24:05,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 289 transitions, 3961 flow [2024-05-12 12:24:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-05-12 12:24:05,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401234567901234 [2024-05-12 12:24:05,355 INFO L175 Difference]: Start difference. First operand has 199 places, 244 transitions, 3002 flow. Second operand 9 states and 175 transitions. [2024-05-12 12:24:05,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 289 transitions, 3961 flow [2024-05-12 12:24:05,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 289 transitions, 3875 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-05-12 12:24:05,422 INFO L231 Difference]: Finished difference. Result has 198 places, 165 transitions, 1963 flow [2024-05-12 12:24:05,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1963, PETRI_PLACES=198, PETRI_TRANSITIONS=165} [2024-05-12 12:24:05,422 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2024-05-12 12:24:05,422 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 165 transitions, 1963 flow [2024-05-12 12:24:05,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 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-05-12 12:24:05,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:05,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:05,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:24:05,423 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:05,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1109805239, now seen corresponding path program 1 times [2024-05-12 12:24:05,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:05,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433687504] [2024-05-12 12:24:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:05,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:05,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433687504] [2024-05-12 12:24:05,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433687504] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:05,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:05,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077362178] [2024-05-12 12:24:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:05,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:05,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:05,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:05,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:05,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:05,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 165 transitions, 1963 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:05,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:05,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:05,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:06,390 INFO L124 PetriNetUnfolderBase]: 732/1504 cut-off events. [2024-05-12 12:24:06,390 INFO L125 PetriNetUnfolderBase]: For 14928/15034 co-relation queries the response was YES. [2024-05-12 12:24:06,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 1504 events. 732/1504 cut-off events. For 14928/15034 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9573 event pairs, 198 based on Foata normal form. 68/1522 useless extension candidates. Maximal degree in co-relation 8267. Up to 988 conditions per place. [2024-05-12 12:24:06,402 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 112 selfloop transitions, 22 changer transitions 23/203 dead transitions. [2024-05-12 12:24:06,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 203 transitions, 2551 flow [2024-05-12 12:24:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:24:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:24:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 12:24:06,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-05-12 12:24:06,403 INFO L175 Difference]: Start difference. First operand has 198 places, 165 transitions, 1963 flow. Second operand 10 states and 178 transitions. [2024-05-12 12:24:06,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 203 transitions, 2551 flow [2024-05-12 12:24:06,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 203 transitions, 2394 flow, removed 42 selfloop flow, removed 15 redundant places. [2024-05-12 12:24:06,435 INFO L231 Difference]: Finished difference. Result has 173 places, 157 transitions, 1828 flow [2024-05-12 12:24:06,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1828, PETRI_PLACES=173, PETRI_TRANSITIONS=157} [2024-05-12 12:24:06,436 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2024-05-12 12:24:06,436 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 157 transitions, 1828 flow [2024-05-12 12:24:06,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:06,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:06,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:06,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:24:06,437 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:06,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -435641692, now seen corresponding path program 1 times [2024-05-12 12:24:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127344920] [2024-05-12 12:24:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:06,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127344920] [2024-05-12 12:24:06,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127344920] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:06,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:06,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74917123] [2024-05-12 12:24:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:06,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:24:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:06,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:24:06,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:24:06,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:24:06,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 157 transitions, 1828 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:06,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:06,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:24:06,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:07,216 INFO L124 PetriNetUnfolderBase]: 675/1432 cut-off events. [2024-05-12 12:24:07,216 INFO L125 PetriNetUnfolderBase]: For 13179/13216 co-relation queries the response was YES. [2024-05-12 12:24:07,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7935 conditions, 1432 events. 675/1432 cut-off events. For 13179/13216 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9335 event pairs, 168 based on Foata normal form. 58/1461 useless extension candidates. Maximal degree in co-relation 7868. Up to 789 conditions per place. [2024-05-12 12:24:07,225 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 87 selfloop transitions, 23 changer transitions 59/209 dead transitions. [2024-05-12 12:24:07,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 209 transitions, 2644 flow [2024-05-12 12:24:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:24:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:24:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-05-12 12:24:07,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-05-12 12:24:07,226 INFO L175 Difference]: Start difference. First operand has 173 places, 157 transitions, 1828 flow. Second operand 10 states and 189 transitions. [2024-05-12 12:24:07,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 209 transitions, 2644 flow [2024-05-12 12:24:07,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 209 transitions, 2510 flow, removed 15 selfloop flow, removed 14 redundant places. [2024-05-12 12:24:07,252 INFO L231 Difference]: Finished difference. Result has 167 places, 137 transitions, 1589 flow [2024-05-12 12:24:07,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1589, PETRI_PLACES=167, PETRI_TRANSITIONS=137} [2024-05-12 12:24:07,253 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 127 predicate places. [2024-05-12 12:24:07,253 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 137 transitions, 1589 flow [2024-05-12 12:24:07,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:07,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:07,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:07,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 12:24:07,254 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:07,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1669055958, now seen corresponding path program 1 times [2024-05-12 12:24:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724002979] [2024-05-12 12:24:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:07,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:07,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724002979] [2024-05-12 12:24:07,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724002979] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:07,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:07,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:07,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269863342] [2024-05-12 12:24:07,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:07,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:07,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:07,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:07,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:07,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:24:07,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 137 transitions, 1589 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:07,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:07,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:24:07,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:08,118 INFO L124 PetriNetUnfolderBase]: 572/1254 cut-off events. [2024-05-12 12:24:08,118 INFO L125 PetriNetUnfolderBase]: For 10723/10792 co-relation queries the response was YES. [2024-05-12 12:24:08,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6725 conditions, 1254 events. 572/1254 cut-off events. For 10723/10792 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8035 event pairs, 133 based on Foata normal form. 61/1291 useless extension candidates. Maximal degree in co-relation 6663. Up to 605 conditions per place. [2024-05-12 12:24:08,125 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 75 selfloop transitions, 24 changer transitions 55/190 dead transitions. [2024-05-12 12:24:08,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 190 transitions, 2395 flow [2024-05-12 12:24:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:24:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:24:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-05-12 12:24:08,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-05-12 12:24:08,126 INFO L175 Difference]: Start difference. First operand has 167 places, 137 transitions, 1589 flow. Second operand 11 states and 210 transitions. [2024-05-12 12:24:08,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 190 transitions, 2395 flow [2024-05-12 12:24:08,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 190 transitions, 2218 flow, removed 21 selfloop flow, removed 12 redundant places. [2024-05-12 12:24:08,150 INFO L231 Difference]: Finished difference. Result has 166 places, 120 transitions, 1370 flow [2024-05-12 12:24:08,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1370, PETRI_PLACES=166, PETRI_TRANSITIONS=120} [2024-05-12 12:24:08,150 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 126 predicate places. [2024-05-12 12:24:08,150 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 120 transitions, 1370 flow [2024-05-12 12:24:08,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:08,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:08,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:08,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 12:24:08,151 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:08,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:08,151 INFO L85 PathProgramCache]: Analyzing trace with hash -964467973, now seen corresponding path program 1 times [2024-05-12 12:24:08,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191797306] [2024-05-12 12:24:08,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:08,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:08,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191797306] [2024-05-12 12:24:08,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191797306] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:08,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345906680] [2024-05-12 12:24:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:08,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:08,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:08,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:24:08,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 120 transitions, 1370 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:08,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:08,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:24:08,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:09,198 INFO L124 PetriNetUnfolderBase]: 433/970 cut-off events. [2024-05-12 12:24:09,198 INFO L125 PetriNetUnfolderBase]: For 8137/8166 co-relation queries the response was YES. [2024-05-12 12:24:09,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 970 events. 433/970 cut-off events. For 8137/8166 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5841 event pairs, 91 based on Foata normal form. 34/991 useless extension candidates. Maximal degree in co-relation 5169. Up to 465 conditions per place. [2024-05-12 12:24:09,204 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 52 selfloop transitions, 13 changer transitions 56/147 dead transitions. [2024-05-12 12:24:09,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 147 transitions, 1770 flow [2024-05-12 12:24:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:24:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:24:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2024-05-12 12:24:09,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2024-05-12 12:24:09,209 INFO L175 Difference]: Start difference. First operand has 166 places, 120 transitions, 1370 flow. Second operand 11 states and 200 transitions. [2024-05-12 12:24:09,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 147 transitions, 1770 flow [2024-05-12 12:24:09,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 1634 flow, removed 24 selfloop flow, removed 17 redundant places. [2024-05-12 12:24:09,227 INFO L231 Difference]: Finished difference. Result has 153 places, 81 transitions, 843 flow [2024-05-12 12:24:09,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=843, PETRI_PLACES=153, PETRI_TRANSITIONS=81} [2024-05-12 12:24:09,228 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 113 predicate places. [2024-05-12 12:24:09,228 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 81 transitions, 843 flow [2024-05-12 12:24:09,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:09,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:09,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:09,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 12:24:09,228 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:09,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:09,228 INFO L85 PathProgramCache]: Analyzing trace with hash 23487079, now seen corresponding path program 1 times [2024-05-12 12:24:09,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:09,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820610705] [2024-05-12 12:24:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:09,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820610705] [2024-05-12 12:24:09,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820610705] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:09,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:09,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:24:09,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644634130] [2024-05-12 12:24:09,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:09,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:24:09,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:09,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:24:09,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:24:09,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:24:09,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 81 transitions, 843 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:09,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:09,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:24:09,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:09,499 INFO L124 PetriNetUnfolderBase]: 380/787 cut-off events. [2024-05-12 12:24:09,501 INFO L125 PetriNetUnfolderBase]: For 4488/4513 co-relation queries the response was YES. [2024-05-12 12:24:09,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3439 conditions, 787 events. 380/787 cut-off events. For 4488/4513 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4274 event pairs, 55 based on Foata normal form. 72/843 useless extension candidates. Maximal degree in co-relation 3383. Up to 409 conditions per place. [2024-05-12 12:24:09,506 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 39 selfloop transitions, 10 changer transitions 1/67 dead transitions. [2024-05-12 12:24:09,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 67 transitions, 724 flow [2024-05-12 12:24:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:24:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:24:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-05-12 12:24:09,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2024-05-12 12:24:09,507 INFO L175 Difference]: Start difference. First operand has 153 places, 81 transitions, 843 flow. Second operand 4 states and 86 transitions. [2024-05-12 12:24:09,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 67 transitions, 724 flow [2024-05-12 12:24:09,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 67 transitions, 484 flow, removed 34 selfloop flow, removed 43 redundant places. [2024-05-12 12:24:09,515 INFO L231 Difference]: Finished difference. Result has 93 places, 58 transitions, 382 flow [2024-05-12 12:24:09,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=93, PETRI_TRANSITIONS=58} [2024-05-12 12:24:09,515 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2024-05-12 12:24:09,516 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 58 transitions, 382 flow [2024-05-12 12:24:09,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:09,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:09,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:09,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 12:24:09,516 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:09,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:09,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1077556166, now seen corresponding path program 1 times [2024-05-12 12:24:09,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:09,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721369730] [2024-05-12 12:24:09,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:09,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:09,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:09,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721369730] [2024-05-12 12:24:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721369730] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:09,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:09,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:24:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310404210] [2024-05-12 12:24:09,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:09,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:24:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:24:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:24:09,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:24:09,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 58 transitions, 382 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-05-12 12:24:09,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:09,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:24:09,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:09,812 INFO L124 PetriNetUnfolderBase]: 251/568 cut-off events. [2024-05-12 12:24:09,812 INFO L125 PetriNetUnfolderBase]: For 1101/1102 co-relation queries the response was YES. [2024-05-12 12:24:09,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 568 events. 251/568 cut-off events. For 1101/1102 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3036 event pairs, 42 based on Foata normal form. 46/598 useless extension candidates. Maximal degree in co-relation 1900. Up to 174 conditions per place. [2024-05-12 12:24:09,815 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 34 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2024-05-12 12:24:09,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 62 transitions, 473 flow [2024-05-12 12:24:09,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:24:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:24:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-05-12 12:24:09,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-05-12 12:24:09,816 INFO L175 Difference]: Start difference. First operand has 93 places, 58 transitions, 382 flow. Second operand 5 states and 99 transitions. [2024-05-12 12:24:09,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 62 transitions, 473 flow [2024-05-12 12:24:09,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 62 transitions, 372 flow, removed 27 selfloop flow, removed 13 redundant places. [2024-05-12 12:24:09,818 INFO L231 Difference]: Finished difference. Result has 86 places, 55 transitions, 307 flow [2024-05-12 12:24:09,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=86, PETRI_TRANSITIONS=55} [2024-05-12 12:24:09,819 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2024-05-12 12:24:09,819 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 55 transitions, 307 flow [2024-05-12 12:24:09,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-05-12 12:24:09,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:09,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:09,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 12:24:09,820 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:09,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1627324187, now seen corresponding path program 1 times [2024-05-12 12:24:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153881801] [2024-05-12 12:24:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:10,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:10,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153881801] [2024-05-12 12:24:10,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153881801] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:10,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:10,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 12:24:10,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651854865] [2024-05-12 12:24:10,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:10,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:24:10,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:24:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:24:10,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:24:10,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 55 transitions, 307 flow. Second operand has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:10,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:10,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:24:10,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:10,773 INFO L124 PetriNetUnfolderBase]: 235/589 cut-off events. [2024-05-12 12:24:10,773 INFO L125 PetriNetUnfolderBase]: For 554/556 co-relation queries the response was YES. [2024-05-12 12:24:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 589 events. 235/589 cut-off events. For 554/556 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3300 event pairs, 45 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 1771. Up to 177 conditions per place. [2024-05-12 12:24:10,775 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 22 selfloop transitions, 9 changer transitions 31/75 dead transitions. [2024-05-12 12:24:10,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 75 transitions, 474 flow [2024-05-12 12:24:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:24:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:24:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2024-05-12 12:24:10,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2024-05-12 12:24:10,778 INFO L175 Difference]: Start difference. First operand has 86 places, 55 transitions, 307 flow. Second operand 11 states and 155 transitions. [2024-05-12 12:24:10,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 75 transitions, 474 flow [2024-05-12 12:24:10,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 75 transitions, 450 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 12:24:10,780 INFO L231 Difference]: Finished difference. Result has 96 places, 37 transitions, 191 flow [2024-05-12 12:24:10,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=191, PETRI_PLACES=96, PETRI_TRANSITIONS=37} [2024-05-12 12:24:10,780 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2024-05-12 12:24:10,780 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 37 transitions, 191 flow [2024-05-12 12:24:10,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:10,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:10,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:10,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 12:24:10,781 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:10,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -464237283, now seen corresponding path program 2 times [2024-05-12 12:24:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:10,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976424771] [2024-05-12 12:24:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 12:24:10,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 12:24:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 12:24:10,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 12:24:10,893 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 12:24:10,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-12 12:24:10,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-12 12:24:10,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 12:24:10,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-05-12 12:24:10,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 12:24:10,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 12:24:10,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-12 12:24:10,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 12:24:10,897 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:10,901 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 12:24:10,901 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 12:24:10,943 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 12:24:10,943 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 12:24:10,944 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 12:24:10 BasicIcfg [2024-05-12 12:24:10,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 12:24:10,944 INFO L158 Benchmark]: Toolchain (without parser) took 166502.66ms. Allocated memory was 197.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 120.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-05-12 12:24:10,944 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:24:10,944 INFO L158 Benchmark]: Witness Parser took 0.22ms. Allocated memory is still 197.1MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:24:10,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.26ms. Allocated memory is still 197.1MB. Free memory was 119.9MB in the beginning and 137.1MB in the end (delta: -17.2MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-05-12 12:24:10,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.11ms. Allocated memory is still 197.1MB. Free memory was 136.4MB in the beginning and 123.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-05-12 12:24:10,945 INFO L158 Benchmark]: Boogie Preprocessor took 105.06ms. Allocated memory is still 197.1MB. Free memory was 123.1MB in the beginning and 116.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-05-12 12:24:10,945 INFO L158 Benchmark]: RCFGBuilder took 924.90ms. Allocated memory is still 197.1MB. Free memory was 116.0MB in the beginning and 129.2MB in the end (delta: -13.2MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-05-12 12:24:10,945 INFO L158 Benchmark]: TraceAbstraction took 164690.23ms. Allocated memory was 197.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 128.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-05-12 12:24:10,946 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.22ms. Allocated memory is still 197.1MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.26ms. Allocated memory is still 197.1MB. Free memory was 119.9MB in the beginning and 137.1MB in the end (delta: -17.2MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.11ms. Allocated memory is still 197.1MB. Free memory was 136.4MB in the beginning and 123.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.06ms. Allocated memory is still 197.1MB. Free memory was 123.1MB in the beginning and 116.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 924.90ms. Allocated memory is still 197.1MB. Free memory was 116.0MB in the beginning and 129.2MB in the end (delta: -13.2MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * TraceAbstraction took 164690.23ms. Allocated memory was 197.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 128.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L791] 0 //@ ghost multithreaded = 1; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] 0 //@ assert ((((((((((((((!multithreaded || ((0 <= x$mem_tmp) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!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_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$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_thd1) + (long long) x$r_buff0_thd2) >= 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$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_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$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_thd1) + (long long) x$r_buff1_thd2) >= 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$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)) && (((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_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$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) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_cnt + (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_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$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) 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_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$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$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_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$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$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_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$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$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_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$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_thd1 + (long long) x$r_buff0_thd2) >= 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$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_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$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_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$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_thd1 + (long long) x$r_buff1_thd2) >= 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_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$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$w_buff0 + (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 + (long long) y) >= 0LL)) && (((long long) x$w_buff1 + (long long) y) >= 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_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$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) 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_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$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)) && (((2LL + (long long) __unbuffered_cnt) - (long long) y) >= 0LL)) && (((2LL + (long long) main$tmp_guard1) - (long long) y) >= 0LL)) && (((2LL + (long long) x) - (long long) y) >= 0LL)) && (((2LL + (long long) x$flush_delayed) - (long long) y) >= 0LL)) && (((2LL + (long long) x$mem_tmp) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff0_thd0) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff0_thd1) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff0_thd2) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff1_thd0) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff1_thd1) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff1_thd2) - (long long) y) >= 0LL)) && (((2LL + (long long) x$read_delayed) - (long long) y) >= 0LL)) && (((2LL + (long long) x$w_buff0) - (long long) y) >= 0LL)) && (((2LL + (long long) x$w_buff1) - (long long) y) >= 0LL)) && (((2LL + (long long) weak$$choice0) - (long long) y) >= 0LL)) && (((2LL + (long long) weak$$choice2) - (long long) y) >= 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_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$read_delayed) >= 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$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$read_delayed) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$read_delayed) >= 0LL)) && (((2LL - (long long) x$r_buff0_thd0) - (long long) y) >= 0LL)) && (((2LL - (long long) x$r_buff0_thd1) - (long long) y) >= 0LL)) && (((2LL - (long long) x$r_buff1_thd0) - (long long) y) >= 0LL)) && (((2LL - (long long) x$r_buff1_thd1) - (long long) y) >= 0LL)) && (((2LL - (long long) x$read_delayed) - (long long) y) >= 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_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$r_buff1_thd1) >= 0LL)) && (((long long) __unbuffered_cnt - (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_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$r_buff1_thd1) >= 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_buff1_thd0) >= 0LL)) && (((long long) x - (long long) x$r_buff1_thd1) >= 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_buff1_thd0) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$r_buff1_thd1) >= 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_buff1_thd0) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$r_buff1_thd1) >= 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_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$read_delayed) >= 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$read_delayed) >= 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$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$read_delayed) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$read_delayed) >= 0LL)) && (((long long) x$r_buff1_thd2 - (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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$r_buff1_thd1) >= 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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$r_buff1_thd1) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$read_delayed) >= 0LL)))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 127)) && ((x$w_buff0 % 2) == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))))) && (!multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= x$mem_tmp)) && (0 <= x$w_buff0)) && (0 <= x$w_buff1)) && (0 <= y)) && (x$w_buff0 <= 127)) && (x$w_buff1 <= 127)) && (y <= 2)) && (y <= 127)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 % 2) == 0)) && ((x$w_buff1 % 2) == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 127)) && ((x$w_buff1 % 2) == 0)) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))))) && (!multithreaded || ((0 <= x) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 //@ assert ((((((((((((((!multithreaded || ((0 <= x$mem_tmp) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!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_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$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_thd1) + (long long) x$r_buff0_thd2) >= 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$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_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$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_thd1) + (long long) x$r_buff1_thd2) >= 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$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)) && (((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_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$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) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_cnt + (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_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$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) 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_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$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$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_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$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$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_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$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$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_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$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_thd1 + (long long) x$r_buff0_thd2) >= 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$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_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$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_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$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_thd1 + (long long) x$r_buff1_thd2) >= 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_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$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$w_buff0 + (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 + (long long) y) >= 0LL)) && (((long long) x$w_buff1 + (long long) y) >= 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_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$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) 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_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$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)) && (((2LL + (long long) __unbuffered_cnt) - (long long) y) >= 0LL)) && (((2LL + (long long) main$tmp_guard1) - (long long) y) >= 0LL)) && (((2LL + (long long) x) - (long long) y) >= 0LL)) && (((2LL + (long long) x$flush_delayed) - (long long) y) >= 0LL)) && (((2LL + (long long) x$mem_tmp) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff0_thd0) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff0_thd1) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff0_thd2) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff1_thd0) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff1_thd1) - (long long) y) >= 0LL)) && (((2LL + (long long) x$r_buff1_thd2) - (long long) y) >= 0LL)) && (((2LL + (long long) x$read_delayed) - (long long) y) >= 0LL)) && (((2LL + (long long) x$w_buff0) - (long long) y) >= 0LL)) && (((2LL + (long long) x$w_buff1) - (long long) y) >= 0LL)) && (((2LL + (long long) weak$$choice0) - (long long) y) >= 0LL)) && (((2LL + (long long) weak$$choice2) - (long long) y) >= 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_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$read_delayed) >= 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$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$read_delayed) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$read_delayed) >= 0LL)) && (((2LL - (long long) x$r_buff0_thd0) - (long long) y) >= 0LL)) && (((2LL - (long long) x$r_buff0_thd1) - (long long) y) >= 0LL)) && (((2LL - (long long) x$r_buff1_thd0) - (long long) y) >= 0LL)) && (((2LL - (long long) x$r_buff1_thd1) - (long long) y) >= 0LL)) && (((2LL - (long long) x$read_delayed) - (long long) y) >= 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_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$r_buff1_thd1) >= 0LL)) && (((long long) __unbuffered_cnt - (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_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$r_buff1_thd1) >= 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_buff1_thd0) >= 0LL)) && (((long long) x - (long long) x$r_buff1_thd1) >= 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_buff1_thd0) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$r_buff1_thd1) >= 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_buff1_thd0) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$r_buff1_thd1) >= 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_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$read_delayed) >= 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$read_delayed) >= 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$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$read_delayed) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$read_delayed) >= 0LL)) && (((long long) x$r_buff1_thd2 - (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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$r_buff1_thd1) >= 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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$r_buff1_thd1) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$read_delayed) >= 0LL)))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 127)) && ((x$w_buff0 % 2) == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))))) && (!multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= x$mem_tmp)) && (0 <= x$w_buff0)) && (0 <= x$w_buff1)) && (0 <= y)) && (x$w_buff0 <= 127)) && (x$w_buff1 <= 127)) && (y <= 2)) && (y <= 127)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 % 2) == 0)) && ((x$w_buff1 % 2) == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 127)) && ((x$w_buff1 % 2) == 0)) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))))) && (!multithreaded || ((0 <= x) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 164.5s, OverallIterations: 55, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2980 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2608 mSDsluCounter, 1354 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1100 mSDsCounter, 743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14724 IncrementalHoareTripleChecker+Invalid, 15467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 743 mSolverCounterUnsat, 254 mSDtfsCounter, 14724 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3512occurred in iteration=43, InterpolantAutomatonStates: 432, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 127.8s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 26633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 54 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-12 12:24:10,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE