./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 14:58:02,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:58:02,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:58:02,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:58:02,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:58:02,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:58:02,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:58:02,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:58:02,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:58:02,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:58:02,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:58:02,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:58:02,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:58:02,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:58:02,863 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:58:02,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:58:02,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:58:02,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:58:02,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:58:02,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:58:02,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:58:02,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:58:02,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:58:02,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:58:02,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:58:02,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:58:02,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:58:02,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:58:02,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:58:02,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:58:02,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:58:02,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:58:02,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:58:02,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:58:02,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:58:02,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:58:02,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:58:02,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:58:02,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:58:02,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:58:02,870 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:58:02,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:58:02,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:58:02,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:58:03,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:58:03,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:58:03,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:58:03,073 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:58:03,074 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:58:03,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-14 14:58:03,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:58:03,267 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:58:03,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2024-06-14 14:58:04,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:58:04,548 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:58:04,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2024-06-14 14:58:04,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72680ed94/cc10b306543649cab8df0f672594ae68/FLAG548064318 [2024-06-14 14:58:04,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72680ed94/cc10b306543649cab8df0f672594ae68 [2024-06-14 14:58:04,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:58:04,577 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:58:04,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:58:04,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:58:04,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:58:04,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:58:03" (1/2) ... [2024-06-14 14:58:04,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b83a5b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:58:04, skipping insertion in model container [2024-06-14 14:58:04,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:58:03" (1/2) ... [2024-06-14 14:58:04,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@387ca2c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:58:04, skipping insertion in model container [2024-06-14 14:58:04,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:58:04" (2/2) ... [2024-06-14 14:58:04,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b83a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:04, skipping insertion in model container [2024-06-14 14:58:04,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:58:04" (2/2) ... [2024-06-14 14:58:04,591 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:58:04,669 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:58:04,671 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 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 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 14:58:04,671 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 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 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 14:58:04,672 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 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 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 14:58:04,672 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:58:04,673 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-14 14:58:04,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:58:05,060 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:58:05,076 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:58:05,439 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:58:05,475 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:58:05,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05 WrapperNode [2024-06-14 14:58:05,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:58:05,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:58:05,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:58:05,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:58:05,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,677 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-06-14 14:58:05,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:58:05,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:58:05,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:58:05,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:58:05,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 14:58:05,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:58:05,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:58:05,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:58:05,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:58:05,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (1/1) ... [2024-06-14 14:58:05,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:58:05,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:58:05,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 14:58:05,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 14:58:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:58:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:58:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:58:05,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:58:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:58:05,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:58:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 14:58:05,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 14:58:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:58:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:58:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:58:05,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:58:05,928 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:58:06,102 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:58:06,104 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:58:07,184 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:58:07,184 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:58:07,467 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:58:07,467 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:58:07,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:58:07 BoogieIcfgContainer [2024-06-14 14:58:07,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:58:07,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:58:07,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:58:07,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:58:07,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:58:03" (1/4) ... [2024-06-14 14:58:07,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe0ad5b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:58:07, skipping insertion in model container [2024-06-14 14:58:07,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:58:04" (2/4) ... [2024-06-14 14:58:07,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe0ad5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:58:07, skipping insertion in model container [2024-06-14 14:58:07,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:58:05" (3/4) ... [2024-06-14 14:58:07,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe0ad5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:58:07, skipping insertion in model container [2024-06-14 14:58:07,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:58:07" (4/4) ... [2024-06-14 14:58:07,476 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2024-06-14 14:58:07,490 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:58:07,490 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 14:58:07,490 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:58:07,614 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:58:07,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-14 14:58:07,688 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-14 14:58:07,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:58:07,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:58:07,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-14 14:58:07,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-14 14:58:07,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:58:07,760 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;@726f3358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:58:07,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 14:58:07,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:58:07,784 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 14:58:07,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:58:07,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:07,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:58:07,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:58:07,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1346525187, now seen corresponding path program 1 times [2024-06-14 14:58:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:07,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533792743] [2024-06-14 14:58:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:07,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:13,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533792743] [2024-06-14 14:58:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533792743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:13,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:13,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:58:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746810613] [2024-06-14 14:58:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:13,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:58:13,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:58:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:58:13,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 14:58:13,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:13,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:13,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 14:58:13,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:14,050 INFO L124 PetriNetUnfolderBase]: 1407/2238 cut-off events. [2024-06-14 14:58:14,050 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-14 14:58:14,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 2238 events. 1407/2238 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11012 event pairs, 989 based on Foata normal form. 1/2150 useless extension candidates. Maximal degree in co-relation 4429. Up to 2105 conditions per place. [2024-06-14 14:58:14,064 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-14 14:58:14,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 177 flow [2024-06-14 14:58:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:58:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:58:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-14 14:58:14,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2024-06-14 14:58:14,074 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 71 transitions. [2024-06-14 14:58:14,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 177 flow [2024-06-14 14:58:14,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 14:58:14,078 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-14 14:58:14,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-14 14:58:14,082 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-14 14:58:14,082 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-14 14:58:14,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:14,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:14,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:14,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:58:14,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:58:14,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1225515812, now seen corresponding path program 1 times [2024-06-14 14:58:14,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:14,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461052028] [2024-06-14 14:58:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:17,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:17,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461052028] [2024-06-14 14:58:17,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461052028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:17,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:17,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:58:17,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590584686] [2024-06-14 14:58:17,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:17,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:58:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:17,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:58:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:58:17,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-14 14:58:17,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 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-06-14 14:58:17,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:17,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-14 14:58:17,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:18,720 INFO L124 PetriNetUnfolderBase]: 1653/2529 cut-off events. [2024-06-14 14:58:18,720 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2024-06-14 14:58:18,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 2529 events. 1653/2529 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12025 event pairs, 1038 based on Foata normal form. 3/2519 useless extension candidates. Maximal degree in co-relation 5705. Up to 2441 conditions per place. [2024-06-14 14:58:18,735 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 42 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-14 14:58:18,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 246 flow [2024-06-14 14:58:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:58:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:58:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-06-14 14:58:18,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-14 14:58:18,738 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 88 transitions. [2024-06-14 14:58:18,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 246 flow [2024-06-14 14:58:18,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:58:18,742 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-14 14:58:18,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-14 14:58:18,743 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-14 14:58:18,743 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-14 14:58:18,744 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-06-14 14:58:18,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:18,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:18,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:58:18,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:58:18,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 663716578, now seen corresponding path program 1 times [2024-06-14 14:58:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883403534] [2024-06-14 14:58:18,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883403534] [2024-06-14 14:58:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883403534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:22,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:22,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:58:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010536570] [2024-06-14 14:58:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:22,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:58:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:22,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:58:22,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:58:22,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-14 14:58:22,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:22,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:22,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-14 14:58:22,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:23,206 INFO L124 PetriNetUnfolderBase]: 1641/2511 cut-off events. [2024-06-14 14:58:23,207 INFO L125 PetriNetUnfolderBase]: For 1294/1294 co-relation queries the response was YES. [2024-06-14 14:58:23,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6289 conditions, 2511 events. 1641/2511 cut-off events. For 1294/1294 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11916 event pairs, 746 based on Foata normal form. 6/2504 useless extension candidates. Maximal degree in co-relation 6272. Up to 2393 conditions per place. [2024-06-14 14:58:23,222 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 50 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-14 14:58:23,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 328 flow [2024-06-14 14:58:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:58:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:58:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-06-14 14:58:23,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-14 14:58:23,228 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 108 transitions. [2024-06-14 14:58:23,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 328 flow [2024-06-14 14:58:23,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 314 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 14:58:23,232 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow [2024-06-14 14:58:23,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-14 14:58:23,233 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2024-06-14 14:58:23,233 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow [2024-06-14 14:58:23,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:23,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:23,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:23,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:58:23,234 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:58:23,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2118459871, now seen corresponding path program 1 times [2024-06-14 14:58:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514795747] [2024-06-14 14:58:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:27,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514795747] [2024-06-14 14:58:27,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514795747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:27,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:27,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:58:27,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855008591] [2024-06-14 14:58:27,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:27,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:58:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:27,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:58:27,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:58:27,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-14 14:58:27,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:27,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:27,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-14 14:58:27,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:28,574 INFO L124 PetriNetUnfolderBase]: 1632/2496 cut-off events. [2024-06-14 14:58:28,575 INFO L125 PetriNetUnfolderBase]: For 2395/2395 co-relation queries the response was YES. [2024-06-14 14:58:28,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 2496 events. 1632/2496 cut-off events. For 2395/2395 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11830 event pairs, 582 based on Foata normal form. 6/2489 useless extension candidates. Maximal degree in co-relation 6822. Up to 2348 conditions per place. [2024-06-14 14:58:28,590 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2024-06-14 14:58:28,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 382 flow [2024-06-14 14:58:28,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:58:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:58:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-14 14:58:28,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-14 14:58:28,593 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 6 states and 123 transitions. [2024-06-14 14:58:28,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 382 flow [2024-06-14 14:58:28,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 358 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:58:28,598 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow [2024-06-14 14:58:28,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-06-14 14:58:28,600 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-14 14:58:28,600 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 193 flow [2024-06-14 14:58:28,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:28,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:28,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:28,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:58:28,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:58:28,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1592947963, now seen corresponding path program 1 times [2024-06-14 14:58:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:28,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797357020] [2024-06-14 14:58:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:35,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:35,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797357020] [2024-06-14 14:58:35,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797357020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:35,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:35,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:58:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307260432] [2024-06-14 14:58:35,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:35,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:58:35,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:35,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:58:35,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:58:35,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-14 14:58:35,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:35,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:35,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-14 14:58:35,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:36,797 INFO L124 PetriNetUnfolderBase]: 1375/2213 cut-off events. [2024-06-14 14:58:36,798 INFO L125 PetriNetUnfolderBase]: For 3103/3103 co-relation queries the response was YES. [2024-06-14 14:58:36,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6335 conditions, 2213 events. 1375/2213 cut-off events. For 3103/3103 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10971 event pairs, 673 based on Foata normal form. 2/2178 useless extension candidates. Maximal degree in co-relation 6316. Up to 2047 conditions per place. [2024-06-14 14:58:36,809 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 44 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-06-14 14:58:36,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 341 flow [2024-06-14 14:58:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:58:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:58:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-14 14:58:36,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-14 14:58:36,810 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 193 flow. Second operand 5 states and 91 transitions. [2024-06-14 14:58:36,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 341 flow [2024-06-14 14:58:36,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 308 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 14:58:36,813 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 206 flow [2024-06-14 14:58:36,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-06-14 14:58:36,814 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-06-14 14:58:36,814 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 206 flow [2024-06-14 14:58:36,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:58:36,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:36,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:36,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:58:36,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:58:36,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:36,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2136747659, now seen corresponding path program 1 times [2024-06-14 14:58:36,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825804848] [2024-06-14 14:58:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:36,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825804848] [2024-06-14 14:58:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825804848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:44,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:44,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:58:44,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715787564] [2024-06-14 14:58:44,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:44,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:58:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:44,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:58:44,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:58:44,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 14:58:44,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 206 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-06-14 14:58:44,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:44,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 14:58:44,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:45,505 INFO L124 PetriNetUnfolderBase]: 1629/2505 cut-off events. [2024-06-14 14:58:45,506 INFO L125 PetriNetUnfolderBase]: For 5036/5036 co-relation queries the response was YES. [2024-06-14 14:58:45,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7756 conditions, 2505 events. 1629/2505 cut-off events. For 5036/5036 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11838 event pairs, 791 based on Foata normal form. 3/2507 useless extension candidates. Maximal degree in co-relation 7735. Up to 2382 conditions per place. [2024-06-14 14:58:45,519 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 53 selfloop transitions, 17 changer transitions 0/74 dead transitions. [2024-06-14 14:58:45,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 462 flow [2024-06-14 14:58:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:58:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:58:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-14 14:58:45,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 14:58:45,521 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 206 flow. Second operand 6 states and 108 transitions. [2024-06-14 14:58:45,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 462 flow [2024-06-14 14:58:45,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 440 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 14:58:45,524 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 309 flow [2024-06-14 14:58:45,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2024-06-14 14:58:45,525 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-06-14 14:58:45,525 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 309 flow [2024-06-14 14:58:45,526 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-06-14 14:58:45,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:45,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:45,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:58:45,526 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:58:45,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1824284786, now seen corresponding path program 1 times [2024-06-14 14:58:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:45,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351423110] [2024-06-14 14:58:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:45,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:58:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:58:53,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:58:53,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351423110] [2024-06-14 14:58:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351423110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:58:53,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:58:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:58:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380065032] [2024-06-14 14:58:53,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:58:53,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:58:53,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:58:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:58:53,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:58:53,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 14:58:53,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 309 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-06-14 14:58:53,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:58:53,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 14:58:53,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:58:54,444 INFO L124 PetriNetUnfolderBase]: 1697/2612 cut-off events. [2024-06-14 14:58:54,444 INFO L125 PetriNetUnfolderBase]: For 7867/7877 co-relation queries the response was YES. [2024-06-14 14:58:54,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9052 conditions, 2612 events. 1697/2612 cut-off events. For 7867/7877 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12379 event pairs, 793 based on Foata normal form. 2/2601 useless extension candidates. Maximal degree in co-relation 9028. Up to 2473 conditions per place. [2024-06-14 14:58:54,456 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 60 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-06-14 14:58:54,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 521 flow [2024-06-14 14:58:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:58:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:58:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-14 14:58:54,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 14:58:54,458 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 309 flow. Second operand 6 states and 105 transitions. [2024-06-14 14:58:54,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 521 flow [2024-06-14 14:58:54,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 505 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-14 14:58:54,462 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 353 flow [2024-06-14 14:58:54,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2024-06-14 14:58:54,463 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2024-06-14 14:58:54,463 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 353 flow [2024-06-14 14:58:54,463 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-06-14 14:58:54,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:58:54,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:58:54,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:58:54,464 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:58:54,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:58:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1343665436, now seen corresponding path program 2 times [2024-06-14 14:58:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:58:54,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844293176] [2024-06-14 14:58:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:58:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:58:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844293176] [2024-06-14 14:59:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844293176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:01,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:01,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:59:01,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900395463] [2024-06-14 14:59:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:01,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:59:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:59:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:59:01,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 14:59:01,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 353 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-06-14 14:59:01,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:01,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 14:59:01,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:02,851 INFO L124 PetriNetUnfolderBase]: 1692/2607 cut-off events. [2024-06-14 14:59:02,851 INFO L125 PetriNetUnfolderBase]: For 10116/10136 co-relation queries the response was YES. [2024-06-14 14:59:02,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9614 conditions, 2607 events. 1692/2607 cut-off events. For 10116/10136 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12372 event pairs, 800 based on Foata normal form. 10/2604 useless extension candidates. Maximal degree in co-relation 9587. Up to 2448 conditions per place. [2024-06-14 14:59:02,866 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-14 14:59:02,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 563 flow [2024-06-14 14:59:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:59:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:59:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-14 14:59:02,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2024-06-14 14:59:02,869 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 353 flow. Second operand 6 states and 104 transitions. [2024-06-14 14:59:02,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 563 flow [2024-06-14 14:59:02,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 527 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 14:59:02,883 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 393 flow [2024-06-14 14:59:02,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-06-14 14:59:02,885 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-14 14:59:02,886 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 393 flow [2024-06-14 14:59:02,886 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-06-14 14:59:02,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:02,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:02,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:59:02,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:59:02,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1343673372, now seen corresponding path program 1 times [2024-06-14 14:59:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954972562] [2024-06-14 14:59:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954972562] [2024-06-14 14:59:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954972562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:11,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:11,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:59:11,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188538463] [2024-06-14 14:59:11,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:11,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:59:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:11,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:59:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:59:11,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 14:59:11,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 393 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:11,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:11,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 14:59:11,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:12,336 INFO L124 PetriNetUnfolderBase]: 1637/2543 cut-off events. [2024-06-14 14:59:12,337 INFO L125 PetriNetUnfolderBase]: For 12161/12161 co-relation queries the response was YES. [2024-06-14 14:59:12,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9901 conditions, 2543 events. 1637/2543 cut-off events. For 12161/12161 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12146 event pairs, 755 based on Foata normal form. 3/2545 useless extension candidates. Maximal degree in co-relation 9873. Up to 2381 conditions per place. [2024-06-14 14:59:12,347 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 63 selfloop transitions, 21 changer transitions 0/88 dead transitions. [2024-06-14 14:59:12,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 677 flow [2024-06-14 14:59:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:59:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:59:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-14 14:59:12,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2024-06-14 14:59:12,361 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 393 flow. Second operand 7 states and 124 transitions. [2024-06-14 14:59:12,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 677 flow [2024-06-14 14:59:12,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 625 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-14 14:59:12,369 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 432 flow [2024-06-14 14:59:12,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-06-14 14:59:12,370 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2024-06-14 14:59:12,370 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 432 flow [2024-06-14 14:59:12,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:12,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:12,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:12,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:59:12,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:59:12,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:12,371 INFO L85 PathProgramCache]: Analyzing trace with hash 413487814, now seen corresponding path program 1 times [2024-06-14 14:59:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397754088] [2024-06-14 14:59:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:12,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:20,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:20,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397754088] [2024-06-14 14:59:20,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397754088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:20,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:20,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:59:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816142930] [2024-06-14 14:59:20,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:20,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:59:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:20,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:59:20,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:59:20,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 14:59:20,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 432 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:20,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:20,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 14:59:20,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:21,359 INFO L124 PetriNetUnfolderBase]: 1756/2680 cut-off events. [2024-06-14 14:59:21,360 INFO L125 PetriNetUnfolderBase]: For 16886/16905 co-relation queries the response was YES. [2024-06-14 14:59:21,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11335 conditions, 2680 events. 1756/2680 cut-off events. For 16886/16905 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12542 event pairs, 680 based on Foata normal form. 5/2678 useless extension candidates. Maximal degree in co-relation 11306. Up to 2493 conditions per place. [2024-06-14 14:59:21,371 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 74 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2024-06-14 14:59:21,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 724 flow [2024-06-14 14:59:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:59:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:59:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 14:59:21,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-14 14:59:21,385 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 432 flow. Second operand 7 states and 125 transitions. [2024-06-14 14:59:21,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 724 flow [2024-06-14 14:59:21,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 99 transitions, 663 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 14:59:21,391 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 469 flow [2024-06-14 14:59:21,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2024-06-14 14:59:21,392 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2024-06-14 14:59:21,392 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 469 flow [2024-06-14 14:59:21,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:21,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:21,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:21,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:59:21,393 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:59:21,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:21,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1473174902, now seen corresponding path program 1 times [2024-06-14 14:59:21,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:21,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445104209] [2024-06-14 14:59:21,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:21,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:28,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445104209] [2024-06-14 14:59:28,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445104209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:28,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:28,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:59:28,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412070477] [2024-06-14 14:59:28,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:28,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:59:28,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:59:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:59:28,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 14:59:28,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 469 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:28,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:28,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 14:59:28,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:29,703 INFO L124 PetriNetUnfolderBase]: 1945/2884 cut-off events. [2024-06-14 14:59:29,703 INFO L125 PetriNetUnfolderBase]: For 20742/20742 co-relation queries the response was YES. [2024-06-14 14:59:29,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12970 conditions, 2884 events. 1945/2884 cut-off events. For 20742/20742 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13029 event pairs, 701 based on Foata normal form. 3/2886 useless extension candidates. Maximal degree in co-relation 12939. Up to 2812 conditions per place. [2024-06-14 14:59:29,717 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 22 changer transitions 0/109 dead transitions. [2024-06-14 14:59:29,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 899 flow [2024-06-14 14:59:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:59:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:59:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-14 14:59:29,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-14 14:59:29,721 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 469 flow. Second operand 7 states and 122 transitions. [2024-06-14 14:59:29,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 899 flow [2024-06-14 14:59:29,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 109 transitions, 853 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-14 14:59:29,729 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 601 flow [2024-06-14 14:59:29,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=601, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2024-06-14 14:59:29,730 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2024-06-14 14:59:29,730 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 601 flow [2024-06-14 14:59:29,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:29,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:29,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:29,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:59:29,731 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:59:29,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1473175088, now seen corresponding path program 2 times [2024-06-14 14:59:29,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090593281] [2024-06-14 14:59:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090593281] [2024-06-14 14:59:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090593281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:36,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:59:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944756295] [2024-06-14 14:59:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:36,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:59:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:59:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:59:37,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 14:59:37,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 601 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:37,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:37,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 14:59:37,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:38,259 INFO L124 PetriNetUnfolderBase]: 1852/2803 cut-off events. [2024-06-14 14:59:38,259 INFO L125 PetriNetUnfolderBase]: For 26796/26827 co-relation queries the response was YES. [2024-06-14 14:59:38,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13682 conditions, 2803 events. 1852/2803 cut-off events. For 26796/26827 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13042 event pairs, 647 based on Foata normal form. 5/2795 useless extension candidates. Maximal degree in co-relation 13648. Up to 2573 conditions per place. [2024-06-14 14:59:38,275 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 81 selfloop transitions, 24 changer transitions 0/116 dead transitions. [2024-06-14 14:59:38,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 116 transitions, 1011 flow [2024-06-14 14:59:38,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:59:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:59:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 14:59:38,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-14 14:59:38,278 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 601 flow. Second operand 7 states and 127 transitions. [2024-06-14 14:59:38,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 116 transitions, 1011 flow [2024-06-14 14:59:38,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 116 transitions, 961 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-06-14 14:59:38,291 INFO L231 Difference]: Finished difference. Result has 81 places, 90 transitions, 701 flow [2024-06-14 14:59:38,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=701, PETRI_PLACES=81, PETRI_TRANSITIONS=90} [2024-06-14 14:59:38,292 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2024-06-14 14:59:38,292 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 701 flow [2024-06-14 14:59:38,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:38,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:38,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:38,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:59:38,293 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:59:38,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1064125816, now seen corresponding path program 2 times [2024-06-14 14:59:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:38,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245617486] [2024-06-14 14:59:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:46,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:46,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245617486] [2024-06-14 14:59:46,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245617486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:46,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:46,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:59:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109110228] [2024-06-14 14:59:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:46,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:59:46,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:59:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:59:46,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 14:59:46,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 701 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:46,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:46,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 14:59:46,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:47,398 INFO L124 PetriNetUnfolderBase]: 2001/2967 cut-off events. [2024-06-14 14:59:47,398 INFO L125 PetriNetUnfolderBase]: For 32002/32014 co-relation queries the response was YES. [2024-06-14 14:59:47,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15123 conditions, 2967 events. 2001/2967 cut-off events. For 32002/32014 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13472 event pairs, 692 based on Foata normal form. 15/2981 useless extension candidates. Maximal degree in co-relation 15087. Up to 2807 conditions per place. [2024-06-14 14:59:47,411 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 85 selfloop transitions, 34 changer transitions 0/122 dead transitions. [2024-06-14 14:59:47,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 122 transitions, 1207 flow [2024-06-14 14:59:47,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:59:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:59:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-14 14:59:47,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2024-06-14 14:59:47,413 INFO L175 Difference]: Start difference. First operand has 81 places, 90 transitions, 701 flow. Second operand 7 states and 123 transitions. [2024-06-14 14:59:47,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 122 transitions, 1207 flow [2024-06-14 14:59:47,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 122 transitions, 1153 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-14 14:59:47,426 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 835 flow [2024-06-14 14:59:47,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=835, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2024-06-14 14:59:47,427 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2024-06-14 14:59:47,427 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 835 flow [2024-06-14 14:59:47,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:47,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:47,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:47,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:59:47,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:59:47,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash 419921554, now seen corresponding path program 3 times [2024-06-14 14:59:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188445501] [2024-06-14 14:59:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:59:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:59:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:59:55,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188445501] [2024-06-14 14:59:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188445501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:59:55,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:59:55,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:59:55,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551516083] [2024-06-14 14:59:55,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:59:55,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:59:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:59:55,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:59:55,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:59:55,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 14:59:55,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 835 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:55,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:59:55,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 14:59:55,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:59:56,687 INFO L124 PetriNetUnfolderBase]: 1860/2823 cut-off events. [2024-06-14 14:59:56,687 INFO L125 PetriNetUnfolderBase]: For 37063/37096 co-relation queries the response was YES. [2024-06-14 14:59:56,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15253 conditions, 2823 events. 1860/2823 cut-off events. For 37063/37096 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13177 event pairs, 662 based on Foata normal form. 12/2828 useless extension candidates. Maximal degree in co-relation 15214. Up to 2546 conditions per place. [2024-06-14 14:59:56,703 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 80 selfloop transitions, 31 changer transitions 0/124 dead transitions. [2024-06-14 14:59:56,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 124 transitions, 1223 flow [2024-06-14 14:59:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:59:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:59:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-14 14:59:56,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 14:59:56,705 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 835 flow. Second operand 7 states and 126 transitions. [2024-06-14 14:59:56,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 124 transitions, 1223 flow [2024-06-14 14:59:56,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 124 transitions, 1118 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-14 14:59:56,724 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 860 flow [2024-06-14 14:59:56,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=860, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2024-06-14 14:59:56,724 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2024-06-14 14:59:56,725 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 860 flow [2024-06-14 14:59:56,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:59:56,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:59:56,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:59:56,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:59:56,725 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:59:56,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:59:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash 420158890, now seen corresponding path program 3 times [2024-06-14 14:59:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:59:56,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356866563] [2024-06-14 14:59:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:59:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:59:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:04,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:04,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356866563] [2024-06-14 15:00:04,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356866563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:04,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:04,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:00:04,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461538509] [2024-06-14 15:00:04,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:04,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:00:04,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:04,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:00:04,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:00:04,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:00:04,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 860 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:04,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:04,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:00:04,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:05,995 INFO L124 PetriNetUnfolderBase]: 1993/2956 cut-off events. [2024-06-14 15:00:05,995 INFO L125 PetriNetUnfolderBase]: For 40414/40426 co-relation queries the response was YES. [2024-06-14 15:00:06,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16089 conditions, 2956 events. 1993/2956 cut-off events. For 40414/40426 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13399 event pairs, 684 based on Foata normal form. 15/2970 useless extension candidates. Maximal degree in co-relation 16049. Up to 2798 conditions per place. [2024-06-14 15:00:06,008 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 81 selfloop transitions, 42 changer transitions 0/126 dead transitions. [2024-06-14 15:00:06,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 126 transitions, 1267 flow [2024-06-14 15:00:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:00:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:00:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-14 15:00:06,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41156462585034015 [2024-06-14 15:00:06,010 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 860 flow. Second operand 7 states and 121 transitions. [2024-06-14 15:00:06,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 126 transitions, 1267 flow [2024-06-14 15:00:06,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 126 transitions, 1161 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 15:00:06,028 INFO L231 Difference]: Finished difference. Result has 91 places, 105 transitions, 902 flow [2024-06-14 15:00:06,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=902, PETRI_PLACES=91, PETRI_TRANSITIONS=105} [2024-06-14 15:00:06,030 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-14 15:00:06,030 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 902 flow [2024-06-14 15:00:06,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:06,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:06,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:06,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:00:06,030 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:00:06,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 420167818, now seen corresponding path program 1 times [2024-06-14 15:00:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869816440] [2024-06-14 15:00:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:14,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:14,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869816440] [2024-06-14 15:00:14,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869816440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:14,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:14,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:00:14,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808282413] [2024-06-14 15:00:14,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:14,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:00:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:14,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:00:14,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:00:15,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:00:15,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 902 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:15,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:15,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:00:15,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:16,242 INFO L124 PetriNetUnfolderBase]: 1744/2704 cut-off events. [2024-06-14 15:00:16,243 INFO L125 PetriNetUnfolderBase]: For 37643/37643 co-relation queries the response was YES. [2024-06-14 15:00:16,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14584 conditions, 2704 events. 1744/2704 cut-off events. For 37643/37643 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12886 event pairs, 560 based on Foata normal form. 6/2709 useless extension candidates. Maximal degree in co-relation 14543. Up to 2510 conditions per place. [2024-06-14 15:00:16,258 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 106 selfloop transitions, 24 changer transitions 0/134 dead transitions. [2024-06-14 15:00:16,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 1336 flow [2024-06-14 15:00:16,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:00:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:00:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 15:00:16,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:00:16,260 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 902 flow. Second operand 8 states and 140 transitions. [2024-06-14 15:00:16,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 1336 flow [2024-06-14 15:00:16,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 134 transitions, 1245 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-14 15:00:16,279 INFO L231 Difference]: Finished difference. Result has 95 places, 108 transitions, 923 flow [2024-06-14 15:00:16,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=923, PETRI_PLACES=95, PETRI_TRANSITIONS=108} [2024-06-14 15:00:16,280 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places. [2024-06-14 15:00:16,280 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 108 transitions, 923 flow [2024-06-14 15:00:16,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:16,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:16,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:16,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:00:16,282 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:00:16,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1852558405, now seen corresponding path program 1 times [2024-06-14 15:00:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:16,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177963308] [2024-06-14 15:00:16,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:16,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177963308] [2024-06-14 15:00:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177963308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:00:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405549582] [2024-06-14 15:00:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:00:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:00:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:00:28,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:00:28,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 108 transitions, 923 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:28,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:28,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:00:28,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:29,065 INFO L124 PetriNetUnfolderBase]: 1741/2699 cut-off events. [2024-06-14 15:00:29,065 INFO L125 PetriNetUnfolderBase]: For 40529/40529 co-relation queries the response was YES. [2024-06-14 15:00:29,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14933 conditions, 2699 events. 1741/2699 cut-off events. For 40529/40529 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12868 event pairs, 579 based on Foata normal form. 1/2699 useless extension candidates. Maximal degree in co-relation 14891. Up to 2579 conditions per place. [2024-06-14 15:00:29,080 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 104 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2024-06-14 15:00:29,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 116 transitions, 1167 flow [2024-06-14 15:00:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:00:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:00:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-06-14 15:00:29,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-14 15:00:29,082 INFO L175 Difference]: Start difference. First operand has 95 places, 108 transitions, 923 flow. Second operand 5 states and 83 transitions. [2024-06-14 15:00:29,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 116 transitions, 1167 flow [2024-06-14 15:00:29,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 116 transitions, 1069 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 15:00:29,101 INFO L231 Difference]: Finished difference. Result has 94 places, 108 transitions, 847 flow [2024-06-14 15:00:29,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=847, PETRI_PLACES=94, PETRI_TRANSITIONS=108} [2024-06-14 15:00:29,102 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2024-06-14 15:00:29,102 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 108 transitions, 847 flow [2024-06-14 15:00:29,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:29,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:29,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:29,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:00:29,102 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:00:29,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1572490645, now seen corresponding path program 1 times [2024-06-14 15:00:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:29,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139255442] [2024-06-14 15:00:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:36,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139255442] [2024-06-14 15:00:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139255442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:36,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:36,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:00:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312166688] [2024-06-14 15:00:36,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:36,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:00:36,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:36,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:00:36,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:00:37,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:00:37,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 108 transitions, 847 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:37,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:37,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:00:37,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:38,300 INFO L124 PetriNetUnfolderBase]: 1855/2815 cut-off events. [2024-06-14 15:00:38,300 INFO L125 PetriNetUnfolderBase]: For 49877/49879 co-relation queries the response was YES. [2024-06-14 15:00:38,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15944 conditions, 2815 events. 1855/2815 cut-off events. For 49877/49879 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13129 event pairs, 637 based on Foata normal form. 4/2818 useless extension candidates. Maximal degree in co-relation 15901. Up to 2601 conditions per place. [2024-06-14 15:00:38,318 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 100 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2024-06-14 15:00:38,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 1153 flow [2024-06-14 15:00:38,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:00:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:00:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 15:00:38,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-14 15:00:38,319 INFO L175 Difference]: Start difference. First operand has 94 places, 108 transitions, 847 flow. Second operand 7 states and 125 transitions. [2024-06-14 15:00:38,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 1153 flow [2024-06-14 15:00:38,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 134 transitions, 1107 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-14 15:00:38,345 INFO L231 Difference]: Finished difference. Result has 97 places, 108 transitions, 851 flow [2024-06-14 15:00:38,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=851, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2024-06-14 15:00:38,345 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2024-06-14 15:00:38,346 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 851 flow [2024-06-14 15:00:38,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:38,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:38,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:38,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:00:38,346 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:00:38,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1572494520, now seen corresponding path program 1 times [2024-06-14 15:00:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172230330] [2024-06-14 15:00:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:46,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172230330] [2024-06-14 15:00:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172230330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:46,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:00:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710239805] [2024-06-14 15:00:46,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:46,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:00:46,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:00:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:00:46,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:00:46,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 851 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:46,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:46,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:00:46,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:47,959 INFO L124 PetriNetUnfolderBase]: 2056/3044 cut-off events. [2024-06-14 15:00:47,960 INFO L125 PetriNetUnfolderBase]: For 56151/56151 co-relation queries the response was YES. [2024-06-14 15:00:47,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17520 conditions, 3044 events. 2056/3044 cut-off events. For 56151/56151 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13812 event pairs, 663 based on Foata normal form. 6/3049 useless extension candidates. Maximal degree in co-relation 17477. Up to 2886 conditions per place. [2024-06-14 15:00:47,980 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 121 selfloop transitions, 32 changer transitions 0/156 dead transitions. [2024-06-14 15:00:47,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 156 transitions, 1521 flow [2024-06-14 15:00:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:00:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:00:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-14 15:00:48,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-14 15:00:48,002 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 851 flow. Second operand 8 states and 143 transitions. [2024-06-14 15:00:48,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 156 transitions, 1521 flow [2024-06-14 15:00:48,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 156 transitions, 1473 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:00:48,036 INFO L231 Difference]: Finished difference. Result has 101 places, 122 transitions, 1075 flow [2024-06-14 15:00:48,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1075, PETRI_PLACES=101, PETRI_TRANSITIONS=122} [2024-06-14 15:00:48,037 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2024-06-14 15:00:48,037 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 122 transitions, 1075 flow [2024-06-14 15:00:48,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:48,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:48,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:48,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:00:48,038 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:00:48,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -488022284, now seen corresponding path program 2 times [2024-06-14 15:00:48,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:48,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880036833] [2024-06-14 15:00:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:00:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:00:55,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:00:55,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880036833] [2024-06-14 15:00:55,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880036833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:00:55,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:00:55,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:00:55,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102200675] [2024-06-14 15:00:55,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:00:55,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:00:55,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:00:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:00:55,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:00:55,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:00:55,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 122 transitions, 1075 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:55,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:00:55,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:00:55,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:00:57,191 INFO L124 PetriNetUnfolderBase]: 2308/3401 cut-off events. [2024-06-14 15:00:57,192 INFO L125 PetriNetUnfolderBase]: For 72863/72863 co-relation queries the response was YES. [2024-06-14 15:00:57,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21315 conditions, 3401 events. 2308/3401 cut-off events. For 72863/72863 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15660 event pairs, 621 based on Foata normal form. 6/3406 useless extension candidates. Maximal degree in co-relation 21269. Up to 2898 conditions per place. [2024-06-14 15:00:57,214 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 126 selfloop transitions, 44 changer transitions 0/173 dead transitions. [2024-06-14 15:00:57,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 173 transitions, 1961 flow [2024-06-14 15:00:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:00:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:00:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 15:00:57,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-14 15:00:57,217 INFO L175 Difference]: Start difference. First operand has 101 places, 122 transitions, 1075 flow. Second operand 8 states and 148 transitions. [2024-06-14 15:00:57,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 173 transitions, 1961 flow [2024-06-14 15:00:57,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 173 transitions, 1857 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-14 15:00:57,264 INFO L231 Difference]: Finished difference. Result has 108 places, 135 transitions, 1290 flow [2024-06-14 15:00:57,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1290, PETRI_PLACES=108, PETRI_TRANSITIONS=135} [2024-06-14 15:00:57,264 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2024-06-14 15:00:57,265 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 135 transitions, 1290 flow [2024-06-14 15:00:57,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:00:57,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:00:57,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:00:57,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:00:57,266 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:00:57,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:00:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash -488016704, now seen corresponding path program 3 times [2024-06-14 15:00:57,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:00:57,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626314804] [2024-06-14 15:00:57,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:00:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:00:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626314804] [2024-06-14 15:01:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626314804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:01:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507538943] [2024-06-14 15:01:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:05,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:01:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:05,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:01:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:01:05,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:01:05,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 135 transitions, 1290 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:05,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:05,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:01:05,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:06,678 INFO L124 PetriNetUnfolderBase]: 2354/3467 cut-off events. [2024-06-14 15:01:06,678 INFO L125 PetriNetUnfolderBase]: For 81748/81748 co-relation queries the response was YES. [2024-06-14 15:01:06,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22920 conditions, 3467 events. 2354/3467 cut-off events. For 81748/81748 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15996 event pairs, 613 based on Foata normal form. 12/3478 useless extension candidates. Maximal degree in co-relation 22871. Up to 2947 conditions per place. [2024-06-14 15:01:06,697 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 121 selfloop transitions, 57 changer transitions 0/181 dead transitions. [2024-06-14 15:01:06,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 181 transitions, 2114 flow [2024-06-14 15:01:06,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:01:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:01:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 15:01:06,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-14 15:01:06,699 INFO L175 Difference]: Start difference. First operand has 108 places, 135 transitions, 1290 flow. Second operand 8 states and 148 transitions. [2024-06-14 15:01:06,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 181 transitions, 2114 flow [2024-06-14 15:01:06,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 181 transitions, 1997 flow, removed 48 selfloop flow, removed 3 redundant places. [2024-06-14 15:01:06,749 INFO L231 Difference]: Finished difference. Result has 115 places, 146 transitions, 1560 flow [2024-06-14 15:01:06,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1560, PETRI_PLACES=115, PETRI_TRANSITIONS=146} [2024-06-14 15:01:06,750 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-14 15:01:06,750 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 146 transitions, 1560 flow [2024-06-14 15:01:06,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:06,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:06,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:06,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:01:06,751 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:01:06,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1576219387, now seen corresponding path program 1 times [2024-06-14 15:01:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:06,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610734355] [2024-06-14 15:01:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:15,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:15,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610734355] [2024-06-14 15:01:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610734355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:15,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:01:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646035297] [2024-06-14 15:01:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:15,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:01:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:15,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:01:15,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:01:15,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:01:15,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 146 transitions, 1560 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:15,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:15,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:01:15,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:16,874 INFO L124 PetriNetUnfolderBase]: 2333/3438 cut-off events. [2024-06-14 15:01:16,874 INFO L125 PetriNetUnfolderBase]: For 86878/86878 co-relation queries the response was YES. [2024-06-14 15:01:16,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23382 conditions, 3438 events. 2333/3438 cut-off events. For 86878/86878 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15783 event pairs, 618 based on Foata normal form. 9/3446 useless extension candidates. Maximal degree in co-relation 23329. Up to 3011 conditions per place. [2024-06-14 15:01:16,896 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 124 selfloop transitions, 64 changer transitions 0/191 dead transitions. [2024-06-14 15:01:16,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 191 transitions, 2424 flow [2024-06-14 15:01:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:01:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:01:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-14 15:01:16,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-14 15:01:16,898 INFO L175 Difference]: Start difference. First operand has 115 places, 146 transitions, 1560 flow. Second operand 8 states and 146 transitions. [2024-06-14 15:01:16,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 191 transitions, 2424 flow [2024-06-14 15:01:16,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 191 transitions, 2289 flow, removed 57 selfloop flow, removed 3 redundant places. [2024-06-14 15:01:16,958 INFO L231 Difference]: Finished difference. Result has 122 places, 158 transitions, 1879 flow [2024-06-14 15:01:16,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1879, PETRI_PLACES=122, PETRI_TRANSITIONS=158} [2024-06-14 15:01:16,958 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2024-06-14 15:01:16,958 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 158 transitions, 1879 flow [2024-06-14 15:01:16,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:16,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:16,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:16,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:01:16,959 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:01:16,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash 140291705, now seen corresponding path program 2 times [2024-06-14 15:01:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:16,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100122544] [2024-06-14 15:01:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100122544] [2024-06-14 15:01:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100122544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:01:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485754226] [2024-06-14 15:01:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:25,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:01:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:25,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:01:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:01:25,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:01:25,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 158 transitions, 1879 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:25,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:25,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:01:25,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:26,949 INFO L124 PetriNetUnfolderBase]: 2423/3569 cut-off events. [2024-06-14 15:01:26,950 INFO L125 PetriNetUnfolderBase]: For 94877/94891 co-relation queries the response was YES. [2024-06-14 15:01:26,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25005 conditions, 3569 events. 2423/3569 cut-off events. For 94877/94891 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16563 event pairs, 617 based on Foata normal form. 11/3579 useless extension candidates. Maximal degree in co-relation 24948. Up to 2853 conditions per place. [2024-06-14 15:01:26,976 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 102 selfloop transitions, 102 changer transitions 0/207 dead transitions. [2024-06-14 15:01:26,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 207 transitions, 2933 flow [2024-06-14 15:01:26,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:01:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:01:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:01:26,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-14 15:01:26,978 INFO L175 Difference]: Start difference. First operand has 122 places, 158 transitions, 1879 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:01:26,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 207 transitions, 2933 flow [2024-06-14 15:01:27,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 207 transitions, 2842 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-14 15:01:27,058 INFO L231 Difference]: Finished difference. Result has 128 places, 175 transitions, 2372 flow [2024-06-14 15:01:27,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2372, PETRI_PLACES=128, PETRI_TRANSITIONS=175} [2024-06-14 15:01:27,058 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places. [2024-06-14 15:01:27,059 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 175 transitions, 2372 flow [2024-06-14 15:01:27,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:27,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:27,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:27,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:01:27,059 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:01:27,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash 140024795, now seen corresponding path program 3 times [2024-06-14 15:01:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826131879] [2024-06-14 15:01:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:36,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:36,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826131879] [2024-06-14 15:01:36,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826131879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:36,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:36,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:01:36,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768387299] [2024-06-14 15:01:36,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:36,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:01:36,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:36,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:01:36,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:01:36,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:01:36,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 175 transitions, 2372 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:36,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:36,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:01:36,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:37,928 INFO L124 PetriNetUnfolderBase]: 2531/3725 cut-off events. [2024-06-14 15:01:37,929 INFO L125 PetriNetUnfolderBase]: For 111458/111472 co-relation queries the response was YES. [2024-06-14 15:01:37,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27884 conditions, 3725 events. 2531/3725 cut-off events. For 111458/111472 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17366 event pairs, 617 based on Foata normal form. 17/3741 useless extension candidates. Maximal degree in co-relation 27824. Up to 3109 conditions per place. [2024-06-14 15:01:37,956 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 120 selfloop transitions, 94 changer transitions 0/217 dead transitions. [2024-06-14 15:01:37,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 217 transitions, 3345 flow [2024-06-14 15:01:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:01:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:01:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 15:01:37,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 15:01:37,967 INFO L175 Difference]: Start difference. First operand has 128 places, 175 transitions, 2372 flow. Second operand 8 states and 150 transitions. [2024-06-14 15:01:37,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 217 transitions, 3345 flow [2024-06-14 15:01:38,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 217 transitions, 3222 flow, removed 53 selfloop flow, removed 2 redundant places. [2024-06-14 15:01:38,050 INFO L231 Difference]: Finished difference. Result has 134 places, 184 transitions, 2645 flow [2024-06-14 15:01:38,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2645, PETRI_PLACES=134, PETRI_TRANSITIONS=184} [2024-06-14 15:01:38,051 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places. [2024-06-14 15:01:38,051 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 184 transitions, 2645 flow [2024-06-14 15:01:38,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:38,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:38,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:38,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:01:38,051 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:01:38,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash 140024578, now seen corresponding path program 4 times [2024-06-14 15:01:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886512264] [2024-06-14 15:01:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:46,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:46,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886512264] [2024-06-14 15:01:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886512264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:46,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:46,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:01:46,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742214483] [2024-06-14 15:01:46,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:46,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:01:46,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:46,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:01:46,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:01:46,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:01:46,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 184 transitions, 2645 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:46,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:46,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:01:46,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:47,765 INFO L124 PetriNetUnfolderBase]: 2565/3773 cut-off events. [2024-06-14 15:01:47,765 INFO L125 PetriNetUnfolderBase]: For 117967/117981 co-relation queries the response was YES. [2024-06-14 15:01:47,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28567 conditions, 3773 events. 2565/3773 cut-off events. For 117967/117981 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17686 event pairs, 611 based on Foata normal form. 20/3792 useless extension candidates. Maximal degree in co-relation 28505. Up to 2794 conditions per place. [2024-06-14 15:01:47,792 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 109 selfloop transitions, 116 changer transitions 0/228 dead transitions. [2024-06-14 15:01:47,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 228 transitions, 3597 flow [2024-06-14 15:01:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:01:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:01:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 15:01:47,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-14 15:01:47,794 INFO L175 Difference]: Start difference. First operand has 134 places, 184 transitions, 2645 flow. Second operand 8 states and 151 transitions. [2024-06-14 15:01:47,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 228 transitions, 3597 flow [2024-06-14 15:01:47,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 228 transitions, 3346 flow, removed 63 selfloop flow, removed 4 redundant places. [2024-06-14 15:01:47,908 INFO L231 Difference]: Finished difference. Result has 138 places, 195 transitions, 2853 flow [2024-06-14 15:01:47,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2394, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2853, PETRI_PLACES=138, PETRI_TRANSITIONS=195} [2024-06-14 15:01:47,908 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2024-06-14 15:01:47,908 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 195 transitions, 2853 flow [2024-06-14 15:01:47,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:47,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:47,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:47,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:01:47,909 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:01:47,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash 132667348, now seen corresponding path program 5 times [2024-06-14 15:01:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:47,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867291095] [2024-06-14 15:01:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:01:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:01:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:01:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867291095] [2024-06-14 15:01:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867291095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:01:55,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:01:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:01:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16121506] [2024-06-14 15:01:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:01:55,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:01:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:01:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:01:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:01:56,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:01:56,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 195 transitions, 2853 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:56,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:01:56,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:01:56,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:01:57,657 INFO L124 PetriNetUnfolderBase]: 2617/3847 cut-off events. [2024-06-14 15:01:57,658 INFO L125 PetriNetUnfolderBase]: For 126743/126757 co-relation queries the response was YES. [2024-06-14 15:01:57,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29685 conditions, 3847 events. 2617/3847 cut-off events. For 126743/126757 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18030 event pairs, 632 based on Foata normal form. 14/3860 useless extension candidates. Maximal degree in co-relation 29622. Up to 2823 conditions per place. [2024-06-14 15:01:57,688 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 132 selfloop transitions, 105 changer transitions 0/240 dead transitions. [2024-06-14 15:01:57,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 240 transitions, 3953 flow [2024-06-14 15:01:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:01:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:01:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 15:01:57,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-14 15:01:57,690 INFO L175 Difference]: Start difference. First operand has 138 places, 195 transitions, 2853 flow. Second operand 8 states and 153 transitions. [2024-06-14 15:01:57,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 240 transitions, 3953 flow [2024-06-14 15:01:57,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 240 transitions, 3837 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-14 15:01:57,812 INFO L231 Difference]: Finished difference. Result has 145 places, 206 transitions, 3238 flow [2024-06-14 15:01:57,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3238, PETRI_PLACES=145, PETRI_TRANSITIONS=206} [2024-06-14 15:01:57,813 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2024-06-14 15:01:57,813 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 206 transitions, 3238 flow [2024-06-14 15:01:57,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:01:57,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:01:57,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:01:57,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:01:57,814 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:01:57,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:01:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash 132673145, now seen corresponding path program 4 times [2024-06-14 15:01:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:01:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948180587] [2024-06-14 15:01:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:01:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:01:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948180587] [2024-06-14 15:02:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948180587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:02:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550307236] [2024-06-14 15:02:06,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:06,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:02:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:02:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:02:06,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:02:06,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 206 transitions, 3238 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:06,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:06,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:02:06,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:08,436 INFO L124 PetriNetUnfolderBase]: 2605/3833 cut-off events. [2024-06-14 15:02:08,436 INFO L125 PetriNetUnfolderBase]: For 131379/131393 co-relation queries the response was YES. [2024-06-14 15:02:08,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30568 conditions, 3833 events. 2605/3833 cut-off events. For 131379/131393 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17995 event pairs, 639 based on Foata normal form. 17/3849 useless extension candidates. Maximal degree in co-relation 30501. Up to 3189 conditions per place. [2024-06-14 15:02:08,466 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 154 selfloop transitions, 82 changer transitions 0/239 dead transitions. [2024-06-14 15:02:08,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 239 transitions, 4104 flow [2024-06-14 15:02:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:02:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:02:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 15:02:08,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 15:02:08,468 INFO L175 Difference]: Start difference. First operand has 145 places, 206 transitions, 3238 flow. Second operand 8 states and 150 transitions. [2024-06-14 15:02:08,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 239 transitions, 4104 flow [2024-06-14 15:02:08,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 239 transitions, 3739 flow, removed 113 selfloop flow, removed 5 redundant places. [2024-06-14 15:02:08,619 INFO L231 Difference]: Finished difference. Result has 148 places, 206 transitions, 3049 flow [2024-06-14 15:02:08,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2873, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3049, PETRI_PLACES=148, PETRI_TRANSITIONS=206} [2024-06-14 15:02:08,620 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places. [2024-06-14 15:02:08,621 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 206 transitions, 3049 flow [2024-06-14 15:02:08,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:08,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:08,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:08,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:02:08,621 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:02:08,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 132672928, now seen corresponding path program 6 times [2024-06-14 15:02:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770403797] [2024-06-14 15:02:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:16,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:16,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770403797] [2024-06-14 15:02:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770403797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:16,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:16,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:02:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251434399] [2024-06-14 15:02:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:16,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:02:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:16,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:02:16,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:02:17,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:02:17,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 206 transitions, 3049 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:17,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:17,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:02:17,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:18,515 INFO L124 PetriNetUnfolderBase]: 2575/3791 cut-off events. [2024-06-14 15:02:18,515 INFO L125 PetriNetUnfolderBase]: For 134652/134666 co-relation queries the response was YES. [2024-06-14 15:02:18,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29130 conditions, 3791 events. 2575/3791 cut-off events. For 134652/134666 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17731 event pairs, 640 based on Foata normal form. 20/3810 useless extension candidates. Maximal degree in co-relation 29064. Up to 2807 conditions per place. [2024-06-14 15:02:18,544 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 132 selfloop transitions, 102 changer transitions 0/237 dead transitions. [2024-06-14 15:02:18,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 237 transitions, 3813 flow [2024-06-14 15:02:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:02:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:02:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 15:02:18,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-14 15:02:18,545 INFO L175 Difference]: Start difference. First operand has 148 places, 206 transitions, 3049 flow. Second operand 8 states and 151 transitions. [2024-06-14 15:02:18,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 237 transitions, 3813 flow [2024-06-14 15:02:18,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 237 transitions, 3496 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-14 15:02:18,669 INFO L231 Difference]: Finished difference. Result has 149 places, 206 transitions, 2950 flow [2024-06-14 15:02:18,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2732, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2950, PETRI_PLACES=149, PETRI_TRANSITIONS=206} [2024-06-14 15:02:18,670 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places. [2024-06-14 15:02:18,670 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 206 transitions, 2950 flow [2024-06-14 15:02:18,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:18,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:18,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:18,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:02:18,671 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:02:18,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1594733979, now seen corresponding path program 1 times [2024-06-14 15:02:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:18,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925513718] [2024-06-14 15:02:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:30,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925513718] [2024-06-14 15:02:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925513718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:30,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:30,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:02:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004495809] [2024-06-14 15:02:30,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:30,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:02:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:30,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:02:30,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:02:30,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:02:30,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 206 transitions, 2950 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:30,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:30,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:02:30,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:32,373 INFO L124 PetriNetUnfolderBase]: 2317/3522 cut-off events. [2024-06-14 15:02:32,373 INFO L125 PetriNetUnfolderBase]: For 117270/117270 co-relation queries the response was YES. [2024-06-14 15:02:32,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26671 conditions, 3522 events. 2317/3522 cut-off events. For 117270/117270 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17086 event pairs, 556 based on Foata normal form. 2/3523 useless extension candidates. Maximal degree in co-relation 26604. Up to 3397 conditions per place. [2024-06-14 15:02:32,400 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 204 selfloop transitions, 11 changer transitions 0/219 dead transitions. [2024-06-14 15:02:32,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 219 transitions, 3432 flow [2024-06-14 15:02:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:02:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:02:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-14 15:02:32,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-14 15:02:32,402 INFO L175 Difference]: Start difference. First operand has 149 places, 206 transitions, 2950 flow. Second operand 6 states and 96 transitions. [2024-06-14 15:02:32,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 219 transitions, 3432 flow [2024-06-14 15:02:32,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 219 transitions, 3122 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-14 15:02:32,509 INFO L231 Difference]: Finished difference. Result has 148 places, 209 transitions, 2702 flow [2024-06-14 15:02:32,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2640, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2702, PETRI_PLACES=148, PETRI_TRANSITIONS=209} [2024-06-14 15:02:32,511 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places. [2024-06-14 15:02:32,511 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 209 transitions, 2702 flow [2024-06-14 15:02:32,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:32,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:32,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:32,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:02:32,512 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:02:32,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1933026383, now seen corresponding path program 1 times [2024-06-14 15:02:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:32,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753152272] [2024-06-14 15:02:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:32,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:40,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:40,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753152272] [2024-06-14 15:02:40,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753152272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:40,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:40,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:02:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346263504] [2024-06-14 15:02:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:40,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:02:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:02:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:02:40,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:02:40,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 209 transitions, 2702 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:40,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:40,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:02:40,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:42,217 INFO L124 PetriNetUnfolderBase]: 2469/3687 cut-off events. [2024-06-14 15:02:42,218 INFO L125 PetriNetUnfolderBase]: For 139234/139240 co-relation queries the response was YES. [2024-06-14 15:02:42,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28083 conditions, 3687 events. 2469/3687 cut-off events. For 139234/139240 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17732 event pairs, 442 based on Foata normal form. 10/3696 useless extension candidates. Maximal degree in co-relation 28016. Up to 3327 conditions per place. [2024-06-14 15:02:42,247 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 185 selfloop transitions, 17 changer transitions 0/242 dead transitions. [2024-06-14 15:02:42,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 242 transitions, 3248 flow [2024-06-14 15:02:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:02:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:02:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 15:02:42,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2024-06-14 15:02:42,251 INFO L175 Difference]: Start difference. First operand has 148 places, 209 transitions, 2702 flow. Second operand 8 states and 139 transitions. [2024-06-14 15:02:42,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 242 transitions, 3248 flow [2024-06-14 15:02:42,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 242 transitions, 3208 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 15:02:42,369 INFO L231 Difference]: Finished difference. Result has 152 places, 211 transitions, 2771 flow [2024-06-14 15:02:42,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2662, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2771, PETRI_PLACES=152, PETRI_TRANSITIONS=211} [2024-06-14 15:02:42,370 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2024-06-14 15:02:42,370 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 211 transitions, 2771 flow [2024-06-14 15:02:42,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:42,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:42,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:42,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:02:42,370 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:02:42,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:42,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1933086957, now seen corresponding path program 1 times [2024-06-14 15:02:42,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:42,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122697634] [2024-06-14 15:02:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:42,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:02:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:02:50,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:02:50,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122697634] [2024-06-14 15:02:50,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122697634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:02:50,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:02:50,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:02:50,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013271799] [2024-06-14 15:02:50,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:02:50,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:02:50,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:02:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:02:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:02:50,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:02:50,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 211 transitions, 2771 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:50,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:02:50,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:02:50,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:02:52,371 INFO L124 PetriNetUnfolderBase]: 2574/3789 cut-off events. [2024-06-14 15:02:52,372 INFO L125 PetriNetUnfolderBase]: For 145997/145997 co-relation queries the response was YES. [2024-06-14 15:02:52,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28988 conditions, 3789 events. 2574/3789 cut-off events. For 145997/145997 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17777 event pairs, 580 based on Foata normal form. 3/3791 useless extension candidates. Maximal degree in co-relation 28920. Up to 3598 conditions per place. [2024-06-14 15:02:52,397 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 202 selfloop transitions, 40 changer transitions 0/245 dead transitions. [2024-06-14 15:02:52,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 245 transitions, 3523 flow [2024-06-14 15:02:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:02:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:02:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-14 15:02:52,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-14 15:02:52,399 INFO L175 Difference]: Start difference. First operand has 152 places, 211 transitions, 2771 flow. Second operand 8 states and 143 transitions. [2024-06-14 15:02:52,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 245 transitions, 3523 flow [2024-06-14 15:02:52,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 245 transitions, 3394 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-14 15:02:52,530 INFO L231 Difference]: Finished difference. Result has 154 places, 211 transitions, 2738 flow [2024-06-14 15:02:52,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2642, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2738, PETRI_PLACES=154, PETRI_TRANSITIONS=211} [2024-06-14 15:02:52,531 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2024-06-14 15:02:52,531 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 211 transitions, 2738 flow [2024-06-14 15:02:52,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:02:52,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:02:52,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:02:52,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:02:52,532 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:02:52,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:02:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1499889487, now seen corresponding path program 2 times [2024-06-14 15:02:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:02:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301151213] [2024-06-14 15:02:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:02:52,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:02:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:01,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:01,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301151213] [2024-06-14 15:03:01,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301151213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:01,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:01,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:03:01,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736989084] [2024-06-14 15:03:01,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:01,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:03:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:03:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:03:01,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:03:01,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 211 transitions, 2738 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:01,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:01,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:03:01,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:03,101 INFO L124 PetriNetUnfolderBase]: 2477/3701 cut-off events. [2024-06-14 15:03:03,101 INFO L125 PetriNetUnfolderBase]: For 157187/157193 co-relation queries the response was YES. [2024-06-14 15:03:03,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28754 conditions, 3701 events. 2477/3701 cut-off events. For 157187/157193 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17782 event pairs, 546 based on Foata normal form. 10/3710 useless extension candidates. Maximal degree in co-relation 28685. Up to 3344 conditions per place. [2024-06-14 15:03:03,131 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 183 selfloop transitions, 21 changer transitions 0/244 dead transitions. [2024-06-14 15:03:03,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 244 transitions, 3294 flow [2024-06-14 15:03:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:03:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:03:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 15:03:03,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:03:03,134 INFO L175 Difference]: Start difference. First operand has 154 places, 211 transitions, 2738 flow. Second operand 8 states and 140 transitions. [2024-06-14 15:03:03,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 244 transitions, 3294 flow [2024-06-14 15:03:03,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 244 transitions, 3186 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 15:03:03,246 INFO L231 Difference]: Finished difference. Result has 155 places, 213 transitions, 2752 flow [2024-06-14 15:03:03,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2752, PETRI_PLACES=155, PETRI_TRANSITIONS=213} [2024-06-14 15:03:03,248 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 112 predicate places. [2024-06-14 15:03:03,248 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 213 transitions, 2752 flow [2024-06-14 15:03:03,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:03,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:03,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:03,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:03:03,248 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:03:03,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:03,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1617977167, now seen corresponding path program 3 times [2024-06-14 15:03:03,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:03,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963358163] [2024-06-14 15:03:03,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:03,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963358163] [2024-06-14 15:03:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963358163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:12,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:12,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:03:12,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502729098] [2024-06-14 15:03:12,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:12,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:03:12,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:12,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:03:12,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:03:12,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:03:12,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 213 transitions, 2752 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:12,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:12,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:03:12,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:13,870 INFO L124 PetriNetUnfolderBase]: 2494/3728 cut-off events. [2024-06-14 15:03:13,870 INFO L125 PetriNetUnfolderBase]: For 168371/168377 co-relation queries the response was YES. [2024-06-14 15:03:13,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29229 conditions, 3728 events. 2494/3728 cut-off events. For 168371/168377 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17959 event pairs, 532 based on Foata normal form. 10/3737 useless extension candidates. Maximal degree in co-relation 29161. Up to 3349 conditions per place. [2024-06-14 15:03:13,902 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 178 selfloop transitions, 26 changer transitions 0/244 dead transitions. [2024-06-14 15:03:13,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 244 transitions, 3308 flow [2024-06-14 15:03:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:03:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:03:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 15:03:13,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:03:13,905 INFO L175 Difference]: Start difference. First operand has 155 places, 213 transitions, 2752 flow. Second operand 8 states and 140 transitions. [2024-06-14 15:03:13,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 244 transitions, 3308 flow [2024-06-14 15:03:14,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 244 transitions, 3206 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-14 15:03:14,068 INFO L231 Difference]: Finished difference. Result has 157 places, 215 transitions, 2785 flow [2024-06-14 15:03:14,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2650, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2785, PETRI_PLACES=157, PETRI_TRANSITIONS=215} [2024-06-14 15:03:14,069 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places. [2024-06-14 15:03:14,069 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 215 transitions, 2785 flow [2024-06-14 15:03:14,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:14,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:14,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:14,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:03:14,070 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:03:14,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2051359211, now seen corresponding path program 1 times [2024-06-14 15:03:14,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:14,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808836738] [2024-06-14 15:03:14,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:22,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808836738] [2024-06-14 15:03:22,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808836738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:22,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:22,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:03:22,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130304785] [2024-06-14 15:03:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:22,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:03:22,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:22,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:03:22,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:03:22,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:03:22,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 215 transitions, 2785 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:22,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:22,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:03:22,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:24,055 INFO L124 PetriNetUnfolderBase]: 2760/4091 cut-off events. [2024-06-14 15:03:24,056 INFO L125 PetriNetUnfolderBase]: For 202768/202768 co-relation queries the response was YES. [2024-06-14 15:03:24,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31823 conditions, 4091 events. 2760/4091 cut-off events. For 202768/202768 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19727 event pairs, 578 based on Foata normal form. 36/4126 useless extension candidates. Maximal degree in co-relation 31754. Up to 3466 conditions per place. [2024-06-14 15:03:24,090 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 188 selfloop transitions, 67 changer transitions 0/258 dead transitions. [2024-06-14 15:03:24,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 258 transitions, 3631 flow [2024-06-14 15:03:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:03:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:03:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-14 15:03:24,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2024-06-14 15:03:24,091 INFO L175 Difference]: Start difference. First operand has 157 places, 215 transitions, 2785 flow. Second operand 9 states and 163 transitions. [2024-06-14 15:03:24,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 258 transitions, 3631 flow [2024-06-14 15:03:24,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 258 transitions, 3514 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-14 15:03:24,256 INFO L231 Difference]: Finished difference. Result has 160 places, 218 transitions, 2897 flow [2024-06-14 15:03:24,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2668, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2897, PETRI_PLACES=160, PETRI_TRANSITIONS=218} [2024-06-14 15:03:24,256 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-14 15:03:24,257 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 218 transitions, 2897 flow [2024-06-14 15:03:24,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:24,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:24,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:24,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:03:24,259 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:03:24,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1175340984, now seen corresponding path program 1 times [2024-06-14 15:03:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:24,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93864421] [2024-06-14 15:03:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:36,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:36,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93864421] [2024-06-14 15:03:36,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93864421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:36,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:36,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:03:36,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244178146] [2024-06-14 15:03:36,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:36,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:03:36,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:36,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:03:36,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:03:36,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:03:36,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 218 transitions, 2897 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:36,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:36,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:03:36,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:38,053 INFO L124 PetriNetUnfolderBase]: 2765/4098 cut-off events. [2024-06-14 15:03:38,054 INFO L125 PetriNetUnfolderBase]: For 192231/192231 co-relation queries the response was YES. [2024-06-14 15:03:38,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32591 conditions, 4098 events. 2765/4098 cut-off events. For 192231/192231 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19833 event pairs, 622 based on Foata normal form. 1/4098 useless extension candidates. Maximal degree in co-relation 32521. Up to 4060 conditions per place. [2024-06-14 15:03:38,084 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 218 selfloop transitions, 16 changer transitions 0/237 dead transitions. [2024-06-14 15:03:38,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 237 transitions, 3528 flow [2024-06-14 15:03:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:03:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:03:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-14 15:03:38,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-14 15:03:38,086 INFO L175 Difference]: Start difference. First operand has 160 places, 218 transitions, 2897 flow. Second operand 6 states and 99 transitions. [2024-06-14 15:03:38,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 237 transitions, 3528 flow [2024-06-14 15:03:38,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 237 transitions, 3345 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-14 15:03:38,275 INFO L231 Difference]: Finished difference. Result has 159 places, 221 transitions, 2807 flow [2024-06-14 15:03:38,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2807, PETRI_PLACES=159, PETRI_TRANSITIONS=221} [2024-06-14 15:03:38,276 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places. [2024-06-14 15:03:38,276 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 221 transitions, 2807 flow [2024-06-14 15:03:38,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:38,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:38,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:38,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:03:38,277 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:03:38,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash 42860745, now seen corresponding path program 2 times [2024-06-14 15:03:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:38,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910637390] [2024-06-14 15:03:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:38,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:47,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910637390] [2024-06-14 15:03:47,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910637390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:47,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:47,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:03:47,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044733773] [2024-06-14 15:03:47,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:47,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:03:47,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:47,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:03:47,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:03:47,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:03:47,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 221 transitions, 2807 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:47,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:47,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:03:47,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:48,969 INFO L124 PetriNetUnfolderBase]: 2917/4350 cut-off events. [2024-06-14 15:03:48,969 INFO L125 PetriNetUnfolderBase]: For 224492/224506 co-relation queries the response was YES. [2024-06-14 15:03:48,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33561 conditions, 4350 events. 2917/4350 cut-off events. For 224492/224506 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21524 event pairs, 589 based on Foata normal form. 44/4393 useless extension candidates. Maximal degree in co-relation 33490. Up to 3517 conditions per place. [2024-06-14 15:03:49,004 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 173 selfloop transitions, 87 changer transitions 0/263 dead transitions. [2024-06-14 15:03:49,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 263 transitions, 3745 flow [2024-06-14 15:03:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:03:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:03:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-14 15:03:49,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2024-06-14 15:03:49,005 INFO L175 Difference]: Start difference. First operand has 159 places, 221 transitions, 2807 flow. Second operand 9 states and 166 transitions. [2024-06-14 15:03:49,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 263 transitions, 3745 flow [2024-06-14 15:03:49,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 263 transitions, 3699 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:03:49,165 INFO L231 Difference]: Finished difference. Result has 164 places, 224 transitions, 3036 flow [2024-06-14 15:03:49,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2761, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3036, PETRI_PLACES=164, PETRI_TRANSITIONS=224} [2024-06-14 15:03:49,166 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places. [2024-06-14 15:03:49,166 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 224 transitions, 3036 flow [2024-06-14 15:03:49,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:49,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:49,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:49,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:03:49,167 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:03:49,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash -182283375, now seen corresponding path program 4 times [2024-06-14 15:03:49,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:49,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308646735] [2024-06-14 15:03:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:49,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:03:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:03:57,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:03:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308646735] [2024-06-14 15:03:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308646735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:03:57,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:03:57,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:03:57,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427923781] [2024-06-14 15:03:57,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:03:57,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:03:57,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:03:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:03:57,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:03:57,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:03:57,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 224 transitions, 3036 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:57,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:03:57,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:03:57,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:03:59,132 INFO L124 PetriNetUnfolderBase]: 2759/4187 cut-off events. [2024-06-14 15:03:59,132 INFO L125 PetriNetUnfolderBase]: For 215638/215658 co-relation queries the response was YES. [2024-06-14 15:03:59,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33298 conditions, 4187 events. 2759/4187 cut-off events. For 215638/215658 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21316 event pairs, 591 based on Foata normal form. 18/4204 useless extension candidates. Maximal degree in co-relation 33226. Up to 3730 conditions per place. [2024-06-14 15:03:59,168 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 176 selfloop transitions, 33 changer transitions 0/252 dead transitions. [2024-06-14 15:03:59,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 252 transitions, 3602 flow [2024-06-14 15:03:59,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:03:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:03:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 15:03:59,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2024-06-14 15:03:59,175 INFO L175 Difference]: Start difference. First operand has 164 places, 224 transitions, 3036 flow. Second operand 8 states and 139 transitions. [2024-06-14 15:03:59,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 252 transitions, 3602 flow [2024-06-14 15:03:59,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 252 transitions, 3377 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-14 15:03:59,349 INFO L231 Difference]: Finished difference. Result has 165 places, 226 transitions, 2968 flow [2024-06-14 15:03:59,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2811, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2968, PETRI_PLACES=165, PETRI_TRANSITIONS=226} [2024-06-14 15:03:59,350 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places. [2024-06-14 15:03:59,350 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 226 transitions, 2968 flow [2024-06-14 15:03:59,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:03:59,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:03:59,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:03:59,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:03:59,351 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:03:59,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:03:59,351 INFO L85 PathProgramCache]: Analyzing trace with hash 54373353, now seen corresponding path program 3 times [2024-06-14 15:03:59,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:03:59,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211830001] [2024-06-14 15:03:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:03:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:03:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:07,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:07,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211830001] [2024-06-14 15:04:07,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211830001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:07,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:07,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:04:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129867540] [2024-06-14 15:04:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:07,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:04:07,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:07,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:04:07,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:04:08,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:04:08,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 226 transitions, 2968 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:08,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:08,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:04:08,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:09,900 INFO L124 PetriNetUnfolderBase]: 3120/4671 cut-off events. [2024-06-14 15:04:09,900 INFO L125 PetriNetUnfolderBase]: For 250197/250211 co-relation queries the response was YES. [2024-06-14 15:04:09,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37246 conditions, 4671 events. 3120/4671 cut-off events. For 250197/250211 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 23603 event pairs, 521 based on Foata normal form. 14/4684 useless extension candidates. Maximal degree in co-relation 37173. Up to 3138 conditions per place. [2024-06-14 15:04:09,933 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 138 selfloop transitions, 131 changer transitions 0/272 dead transitions. [2024-06-14 15:04:09,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 272 transitions, 4106 flow [2024-06-14 15:04:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:04:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:04:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-14 15:04:09,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417989417989418 [2024-06-14 15:04:09,937 INFO L175 Difference]: Start difference. First operand has 165 places, 226 transitions, 2968 flow. Second operand 9 states and 167 transitions. [2024-06-14 15:04:09,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 272 transitions, 4106 flow [2024-06-14 15:04:10,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 272 transitions, 3967 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-06-14 15:04:10,140 INFO L231 Difference]: Finished difference. Result has 168 places, 232 transitions, 3293 flow [2024-06-14 15:04:10,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2829, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3293, PETRI_PLACES=168, PETRI_TRANSITIONS=232} [2024-06-14 15:04:10,141 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places. [2024-06-14 15:04:10,141 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 232 transitions, 3293 flow [2024-06-14 15:04:10,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:10,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:10,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:10,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:04:10,141 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:04:10,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:10,142 INFO L85 PathProgramCache]: Analyzing trace with hash 279036105, now seen corresponding path program 4 times [2024-06-14 15:04:10,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:10,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677425018] [2024-06-14 15:04:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:10,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677425018] [2024-06-14 15:04:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677425018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:19,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:19,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:04:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623206131] [2024-06-14 15:04:19,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:19,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:04:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:04:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:04:19,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:04:19,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 232 transitions, 3293 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:19,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:19,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:04:19,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:20,948 INFO L124 PetriNetUnfolderBase]: 3148/4715 cut-off events. [2024-06-14 15:04:20,949 INFO L125 PetriNetUnfolderBase]: For 266562/266576 co-relation queries the response was YES. [2024-06-14 15:04:20,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38844 conditions, 4715 events. 3148/4715 cut-off events. For 266562/266576 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 24004 event pairs, 608 based on Foata normal form. 14/4728 useless extension candidates. Maximal degree in co-relation 38770. Up to 3900 conditions per place. [2024-06-14 15:04:20,988 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 145 selfloop transitions, 120 changer transitions 0/268 dead transitions. [2024-06-14 15:04:20,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 268 transitions, 4161 flow [2024-06-14 15:04:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:04:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:04:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-14 15:04:20,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2024-06-14 15:04:20,990 INFO L175 Difference]: Start difference. First operand has 168 places, 232 transitions, 3293 flow. Second operand 9 states and 160 transitions. [2024-06-14 15:04:20,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 268 transitions, 4161 flow [2024-06-14 15:04:21,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 268 transitions, 3891 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-06-14 15:04:21,222 INFO L231 Difference]: Finished difference. Result has 172 places, 235 transitions, 3377 flow [2024-06-14 15:04:21,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3033, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3377, PETRI_PLACES=172, PETRI_TRANSITIONS=235} [2024-06-14 15:04:21,222 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places. [2024-06-14 15:04:21,223 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 235 transitions, 3377 flow [2024-06-14 15:04:21,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:21,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:21,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:21,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:04:21,223 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:04:21,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash 270761895, now seen corresponding path program 5 times [2024-06-14 15:04:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769853843] [2024-06-14 15:04:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:21,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:30,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:30,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769853843] [2024-06-14 15:04:30,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769853843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:30,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:30,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:04:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121763055] [2024-06-14 15:04:30,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:30,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:04:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:04:30,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:04:30,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:04:30,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 235 transitions, 3377 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:30,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:30,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:04:30,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:32,227 INFO L124 PetriNetUnfolderBase]: 3092/4635 cut-off events. [2024-06-14 15:04:32,227 INFO L125 PetriNetUnfolderBase]: For 270349/270363 co-relation queries the response was YES. [2024-06-14 15:04:32,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37319 conditions, 4635 events. 3092/4635 cut-off events. For 270349/270363 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 23441 event pairs, 588 based on Foata normal form. 44/4678 useless extension candidates. Maximal degree in co-relation 37243. Up to 3818 conditions per place. [2024-06-14 15:04:32,259 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 167 selfloop transitions, 103 changer transitions 0/273 dead transitions. [2024-06-14 15:04:32,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 273 transitions, 4193 flow [2024-06-14 15:04:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:04:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:04:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-14 15:04:32,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-14 15:04:32,261 INFO L175 Difference]: Start difference. First operand has 172 places, 235 transitions, 3377 flow. Second operand 9 states and 165 transitions. [2024-06-14 15:04:32,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 273 transitions, 4193 flow [2024-06-14 15:04:32,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 273 transitions, 3897 flow, removed 58 selfloop flow, removed 6 redundant places. [2024-06-14 15:04:32,505 INFO L231 Difference]: Finished difference. Result has 175 places, 235 transitions, 3296 flow [2024-06-14 15:04:32,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3081, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3296, PETRI_PLACES=175, PETRI_TRANSITIONS=235} [2024-06-14 15:04:32,506 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 132 predicate places. [2024-06-14 15:04:32,506 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 235 transitions, 3296 flow [2024-06-14 15:04:32,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:32,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:32,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:32,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:04:32,507 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:04:32,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2102842074, now seen corresponding path program 2 times [2024-06-14 15:04:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:32,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825093193] [2024-06-14 15:04:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:45,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:45,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825093193] [2024-06-14 15:04:45,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825093193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:45,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:45,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:04:45,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503611614] [2024-06-14 15:04:45,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:45,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:04:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:04:45,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:04:45,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:04:45,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 235 transitions, 3296 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:45,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:45,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:04:45,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:46,701 INFO L124 PetriNetUnfolderBase]: 3089/4629 cut-off events. [2024-06-14 15:04:46,702 INFO L125 PetriNetUnfolderBase]: For 247131/247145 co-relation queries the response was YES. [2024-06-14 15:04:46,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36879 conditions, 4629 events. 3089/4629 cut-off events. For 247131/247145 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 23417 event pairs, 696 based on Foata normal form. 15/4643 useless extension candidates. Maximal degree in co-relation 36802. Up to 4590 conditions per place. [2024-06-14 15:04:46,745 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 225 selfloop transitions, 16 changer transitions 0/244 dead transitions. [2024-06-14 15:04:46,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 244 transitions, 3800 flow [2024-06-14 15:04:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:04:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:04:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-06-14 15:04:46,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2024-06-14 15:04:46,747 INFO L175 Difference]: Start difference. First operand has 175 places, 235 transitions, 3296 flow. Second operand 6 states and 92 transitions. [2024-06-14 15:04:46,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 244 transitions, 3800 flow [2024-06-14 15:04:46,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 244 transitions, 3542 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:04:46,959 INFO L231 Difference]: Finished difference. Result has 173 places, 235 transitions, 3076 flow [2024-06-14 15:04:46,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3038, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3076, PETRI_PLACES=173, PETRI_TRANSITIONS=235} [2024-06-14 15:04:46,960 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-14 15:04:46,960 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 235 transitions, 3076 flow [2024-06-14 15:04:46,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:46,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:46,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:46,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:04:46,960 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:04:46,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1181060856, now seen corresponding path program 1 times [2024-06-14 15:04:46,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:46,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050033373] [2024-06-14 15:04:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:57,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050033373] [2024-06-14 15:04:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050033373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:57,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:57,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:04:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173590749] [2024-06-14 15:04:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:57,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:04:57,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:57,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:04:57,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:04:57,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:04:57,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 235 transitions, 3076 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:57,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:57,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:04:57,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:58,614 INFO L124 PetriNetUnfolderBase]: 2842/4376 cut-off events. [2024-06-14 15:04:58,615 INFO L125 PetriNetUnfolderBase]: For 215382/215382 co-relation queries the response was YES. [2024-06-14 15:04:58,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33100 conditions, 4376 events. 2842/4376 cut-off events. For 215382/215382 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22888 event pairs, 605 based on Foata normal form. 2/4377 useless extension candidates. Maximal degree in co-relation 33022. Up to 4224 conditions per place. [2024-06-14 15:04:58,655 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 228 selfloop transitions, 19 changer transitions 0/251 dead transitions. [2024-06-14 15:04:58,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 251 transitions, 3727 flow [2024-06-14 15:04:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:04:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:04:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-14 15:04:58,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4087301587301587 [2024-06-14 15:04:58,656 INFO L175 Difference]: Start difference. First operand has 173 places, 235 transitions, 3076 flow. Second operand 6 states and 103 transitions. [2024-06-14 15:04:58,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 251 transitions, 3727 flow [2024-06-14 15:04:58,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 251 transitions, 3687 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 15:04:58,954 INFO L231 Difference]: Finished difference. Result has 174 places, 238 transitions, 3127 flow [2024-06-14 15:04:58,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3036, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3127, PETRI_PLACES=174, PETRI_TRANSITIONS=238} [2024-06-14 15:04:58,955 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places. [2024-06-14 15:04:58,955 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 238 transitions, 3127 flow [2024-06-14 15:04:58,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:58,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:58,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:58,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:04:58,955 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:04:58,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2102848026, now seen corresponding path program 2 times [2024-06-14 15:04:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:58,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269790452] [2024-06-14 15:04:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:58,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269790452] [2024-06-14 15:05:09,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269790452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:09,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:09,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:05:09,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801751747] [2024-06-14 15:05:09,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:09,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:05:09,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:05:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:05:09,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:05:09,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 238 transitions, 3127 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:09,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:09,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:05:09,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:10,676 INFO L124 PetriNetUnfolderBase]: 2792/4296 cut-off events. [2024-06-14 15:05:10,676 INFO L125 PetriNetUnfolderBase]: For 221540/221540 co-relation queries the response was YES. [2024-06-14 15:05:10,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32840 conditions, 4296 events. 2792/4296 cut-off events. For 221540/221540 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22361 event pairs, 598 based on Foata normal form. 1/4296 useless extension candidates. Maximal degree in co-relation 32761. Up to 4175 conditions per place. [2024-06-14 15:05:10,711 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 232 selfloop transitions, 11 changer transitions 0/247 dead transitions. [2024-06-14 15:05:10,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 247 transitions, 3635 flow [2024-06-14 15:05:10,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:05:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:05:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-14 15:05:10,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.376984126984127 [2024-06-14 15:05:10,713 INFO L175 Difference]: Start difference. First operand has 174 places, 238 transitions, 3127 flow. Second operand 6 states and 95 transitions. [2024-06-14 15:05:10,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 247 transitions, 3635 flow [2024-06-14 15:05:10,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 247 transitions, 3606 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:05:10,962 INFO L231 Difference]: Finished difference. Result has 177 places, 238 transitions, 3126 flow [2024-06-14 15:05:10,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3098, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3126, PETRI_PLACES=177, PETRI_TRANSITIONS=238} [2024-06-14 15:05:10,964 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-14 15:05:10,964 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 238 transitions, 3126 flow [2024-06-14 15:05:10,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:10,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:10,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:10,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:05:10,965 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:05:10,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash -205723209, now seen corresponding path program 1 times [2024-06-14 15:05:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597559110] [2024-06-14 15:05:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:19,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597559110] [2024-06-14 15:05:19,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597559110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:19,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:05:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454411540] [2024-06-14 15:05:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:19,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:05:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:05:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:05:19,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:05:19,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 238 transitions, 3126 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:19,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:19,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:05:19,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:21,404 INFO L124 PetriNetUnfolderBase]: 3095/4632 cut-off events. [2024-06-14 15:05:21,405 INFO L125 PetriNetUnfolderBase]: For 274893/274893 co-relation queries the response was YES. [2024-06-14 15:05:21,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36916 conditions, 4632 events. 3095/4632 cut-off events. For 274893/274893 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 23268 event pairs, 496 based on Foata normal form. 6/4637 useless extension candidates. Maximal degree in co-relation 36836. Up to 4421 conditions per place. [2024-06-14 15:05:21,443 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 249 selfloop transitions, 33 changer transitions 0/285 dead transitions. [2024-06-14 15:05:21,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 285 transitions, 4238 flow [2024-06-14 15:05:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:05:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:05:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-14 15:05:21,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2024-06-14 15:05:21,445 INFO L175 Difference]: Start difference. First operand has 177 places, 238 transitions, 3126 flow. Second operand 9 states and 156 transitions. [2024-06-14 15:05:21,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 285 transitions, 4238 flow [2024-06-14 15:05:21,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 285 transitions, 4191 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:05:21,701 INFO L231 Difference]: Finished difference. Result has 182 places, 246 transitions, 3370 flow [2024-06-14 15:05:21,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3079, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3370, PETRI_PLACES=182, PETRI_TRANSITIONS=246} [2024-06-14 15:05:21,702 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places. [2024-06-14 15:05:21,702 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 246 transitions, 3370 flow [2024-06-14 15:05:21,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:21,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:21,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:21,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:05:21,703 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:05:21,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash -203845539, now seen corresponding path program 2 times [2024-06-14 15:05:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:21,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313196709] [2024-06-14 15:05:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:21,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313196709] [2024-06-14 15:05:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313196709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:31,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:31,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:05:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458269404] [2024-06-14 15:05:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:31,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:05:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:05:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:05:31,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:05:31,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 246 transitions, 3370 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:31,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:31,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:05:31,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:33,285 INFO L124 PetriNetUnfolderBase]: 3123/4676 cut-off events. [2024-06-14 15:05:33,286 INFO L125 PetriNetUnfolderBase]: For 293055/293055 co-relation queries the response was YES. [2024-06-14 15:05:33,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38126 conditions, 4676 events. 3123/4676 cut-off events. For 293055/293055 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23676 event pairs, 630 based on Foata normal form. 6/4681 useless extension candidates. Maximal degree in co-relation 38043. Up to 4450 conditions per place. [2024-06-14 15:05:33,329 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 238 selfloop transitions, 46 changer transitions 0/287 dead transitions. [2024-06-14 15:05:33,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 287 transitions, 4310 flow [2024-06-14 15:05:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:05:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:05:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 15:05:33,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41534391534391535 [2024-06-14 15:05:33,331 INFO L175 Difference]: Start difference. First operand has 182 places, 246 transitions, 3370 flow. Second operand 9 states and 157 transitions. [2024-06-14 15:05:33,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 287 transitions, 4310 flow [2024-06-14 15:05:33,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 287 transitions, 4149 flow, removed 66 selfloop flow, removed 4 redundant places. [2024-06-14 15:05:33,577 INFO L231 Difference]: Finished difference. Result has 187 places, 249 transitions, 3414 flow [2024-06-14 15:05:33,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3209, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3414, PETRI_PLACES=187, PETRI_TRANSITIONS=249} [2024-06-14 15:05:33,594 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places. [2024-06-14 15:05:33,594 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 249 transitions, 3414 flow [2024-06-14 15:05:33,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:33,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:33,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:33,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:05:33,595 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:05:33,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash -664948207, now seen corresponding path program 3 times [2024-06-14 15:05:33,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:33,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540254191] [2024-06-14 15:05:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540254191] [2024-06-14 15:05:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540254191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:05:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757671572] [2024-06-14 15:05:43,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:43,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:05:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:43,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:05:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:05:43,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:05:43,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 249 transitions, 3414 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:43,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:43,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:05:43,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:45,290 INFO L124 PetriNetUnfolderBase]: 3177/4758 cut-off events. [2024-06-14 15:05:45,290 INFO L125 PetriNetUnfolderBase]: For 309023/309023 co-relation queries the response was YES. [2024-06-14 15:05:45,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39327 conditions, 4758 events. 3177/4758 cut-off events. For 309023/309023 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 24244 event pairs, 643 based on Foata normal form. 6/4763 useless extension candidates. Maximal degree in co-relation 39242. Up to 4437 conditions per place. [2024-06-14 15:05:45,330 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 245 selfloop transitions, 46 changer transitions 0/294 dead transitions. [2024-06-14 15:05:45,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 294 transitions, 4544 flow [2024-06-14 15:05:45,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:05:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:05:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-14 15:05:45,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2024-06-14 15:05:45,331 INFO L175 Difference]: Start difference. First operand has 187 places, 249 transitions, 3414 flow. Second operand 9 states and 158 transitions. [2024-06-14 15:05:45,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 294 transitions, 4544 flow [2024-06-14 15:05:45,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 294 transitions, 4365 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-14 15:05:45,585 INFO L231 Difference]: Finished difference. Result has 190 places, 255 transitions, 3537 flow [2024-06-14 15:05:45,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3235, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3537, PETRI_PLACES=190, PETRI_TRANSITIONS=255} [2024-06-14 15:05:45,585 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places. [2024-06-14 15:05:45,586 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 255 transitions, 3537 flow [2024-06-14 15:05:45,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:45,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:45,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:45,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:05:45,586 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:05:45,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1105782084, now seen corresponding path program 1 times [2024-06-14 15:05:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:45,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470066810] [2024-06-14 15:05:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470066810] [2024-06-14 15:05:59,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470066810] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:59,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:59,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:05:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178526189] [2024-06-14 15:05:59,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:05:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:59,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:05:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:05:59,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:05:59,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 255 transitions, 3537 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:59,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:59,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:05:59,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:00,950 INFO L124 PetriNetUnfolderBase]: 3187/4772 cut-off events. [2024-06-14 15:06:00,950 INFO L125 PetriNetUnfolderBase]: For 322010/322010 co-relation queries the response was YES. [2024-06-14 15:06:00,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39875 conditions, 4772 events. 3187/4772 cut-off events. For 322010/322010 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 24349 event pairs, 664 based on Foata normal form. 2/4773 useless extension candidates. Maximal degree in co-relation 39788. Up to 4686 conditions per place. [2024-06-14 15:06:00,991 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 251 selfloop transitions, 30 changer transitions 0/284 dead transitions. [2024-06-14 15:06:00,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 284 transitions, 4370 flow [2024-06-14 15:06:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:06:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:06:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-14 15:06:00,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-14 15:06:00,993 INFO L175 Difference]: Start difference. First operand has 190 places, 255 transitions, 3537 flow. Second operand 7 states and 119 transitions. [2024-06-14 15:06:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 284 transitions, 4370 flow [2024-06-14 15:06:01,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 284 transitions, 4180 flow, removed 68 selfloop flow, removed 5 redundant places. [2024-06-14 15:06:01,298 INFO L231 Difference]: Finished difference. Result has 192 places, 260 transitions, 3530 flow [2024-06-14 15:06:01,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3530, PETRI_PLACES=192, PETRI_TRANSITIONS=260} [2024-06-14 15:06:01,299 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places. [2024-06-14 15:06:01,299 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 260 transitions, 3530 flow [2024-06-14 15:06:01,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:01,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:01,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:01,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:06:01,299 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:06:01,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash 388695583, now seen corresponding path program 4 times [2024-06-14 15:06:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:01,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218858803] [2024-06-14 15:06:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:01,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:09,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218858803] [2024-06-14 15:06:09,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218858803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:09,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:09,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:06:09,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169210015] [2024-06-14 15:06:09,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:09,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:06:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:09,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:06:09,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:06:10,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:06:10,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 260 transitions, 3530 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:10,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:10,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:06:10,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:12,161 INFO L124 PetriNetUnfolderBase]: 3215/4816 cut-off events. [2024-06-14 15:06:12,162 INFO L125 PetriNetUnfolderBase]: For 335782/335782 co-relation queries the response was YES. [2024-06-14 15:06:12,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40146 conditions, 4816 events. 3215/4816 cut-off events. For 335782/335782 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24584 event pairs, 634 based on Foata normal form. 6/4821 useless extension candidates. Maximal degree in co-relation 40057. Up to 4286 conditions per place. [2024-06-14 15:06:12,210 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 227 selfloop transitions, 70 changer transitions 0/300 dead transitions. [2024-06-14 15:06:12,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 300 transitions, 4612 flow [2024-06-14 15:06:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:06:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:06:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 15:06:12,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-14 15:06:12,212 INFO L175 Difference]: Start difference. First operand has 192 places, 260 transitions, 3530 flow. Second operand 9 states and 161 transitions. [2024-06-14 15:06:12,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 300 transitions, 4612 flow [2024-06-14 15:06:12,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 300 transitions, 4524 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 15:06:12,644 INFO L231 Difference]: Finished difference. Result has 196 places, 263 transitions, 3706 flow [2024-06-14 15:06:12,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3442, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3706, PETRI_PLACES=196, PETRI_TRANSITIONS=263} [2024-06-14 15:06:12,644 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places. [2024-06-14 15:06:12,645 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 263 transitions, 3706 flow [2024-06-14 15:06:12,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:12,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:12,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:12,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:06:12,645 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:06:12,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1227500647, now seen corresponding path program 5 times [2024-06-14 15:06:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093382655] [2024-06-14 15:06:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093382655] [2024-06-14 15:06:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093382655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:21,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:06:21,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481674443] [2024-06-14 15:06:21,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:21,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:06:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:06:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:06:21,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:06:21,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 263 transitions, 3706 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:21,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:21,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:06:21,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:23,677 INFO L124 PetriNetUnfolderBase]: 3464/5207 cut-off events. [2024-06-14 15:06:23,678 INFO L125 PetriNetUnfolderBase]: For 393996/393996 co-relation queries the response was YES. [2024-06-14 15:06:23,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46073 conditions, 5207 events. 3464/5207 cut-off events. For 393996/393996 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 27250 event pairs, 728 based on Foata normal form. 6/5212 useless extension candidates. Maximal degree in co-relation 45983. Up to 4287 conditions per place. [2024-06-14 15:06:23,724 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 237 selfloop transitions, 73 changer transitions 0/313 dead transitions. [2024-06-14 15:06:23,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 313 transitions, 5186 flow [2024-06-14 15:06:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:06:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:06:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-14 15:06:23,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417989417989418 [2024-06-14 15:06:23,725 INFO L175 Difference]: Start difference. First operand has 196 places, 263 transitions, 3706 flow. Second operand 9 states and 167 transitions. [2024-06-14 15:06:23,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 313 transitions, 5186 flow [2024-06-14 15:06:24,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 313 transitions, 4967 flow, removed 52 selfloop flow, removed 6 redundant places. [2024-06-14 15:06:24,162 INFO L231 Difference]: Finished difference. Result has 200 places, 269 transitions, 3867 flow [2024-06-14 15:06:24,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3487, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3867, PETRI_PLACES=200, PETRI_TRANSITIONS=269} [2024-06-14 15:06:24,162 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places. [2024-06-14 15:06:24,163 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 269 transitions, 3867 flow [2024-06-14 15:06:24,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:24,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:24,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:24,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:06:24,163 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:06:24,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1376804063, now seen corresponding path program 6 times [2024-06-14 15:06:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006719596] [2024-06-14 15:06:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:32,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:32,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006719596] [2024-06-14 15:06:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006719596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:32,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:32,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:06:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808003524] [2024-06-14 15:06:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:32,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:06:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:06:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:06:32,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:06:32,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 269 transitions, 3867 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:32,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:32,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:06:32,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:34,969 INFO L124 PetriNetUnfolderBase]: 3480/5235 cut-off events. [2024-06-14 15:06:34,969 INFO L125 PetriNetUnfolderBase]: For 436076/436076 co-relation queries the response was YES. [2024-06-14 15:06:34,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45813 conditions, 5235 events. 3480/5235 cut-off events. For 436076/436076 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27466 event pairs, 676 based on Foata normal form. 36/5270 useless extension candidates. Maximal degree in co-relation 45721. Up to 4527 conditions per place. [2024-06-14 15:06:35,012 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 232 selfloop transitions, 77 changer transitions 0/312 dead transitions. [2024-06-14 15:06:35,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 312 transitions, 4929 flow [2024-06-14 15:06:35,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:06:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:06:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-14 15:06:35,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-14 15:06:35,014 INFO L175 Difference]: Start difference. First operand has 200 places, 269 transitions, 3867 flow. Second operand 9 states and 165 transitions. [2024-06-14 15:06:35,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 312 transitions, 4929 flow [2024-06-14 15:06:35,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 312 transitions, 4687 flow, removed 79 selfloop flow, removed 5 redundant places. [2024-06-14 15:06:35,402 INFO L231 Difference]: Finished difference. Result has 204 places, 272 transitions, 3919 flow [2024-06-14 15:06:35,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3643, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3919, PETRI_PLACES=204, PETRI_TRANSITIONS=272} [2024-06-14 15:06:35,403 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2024-06-14 15:06:35,403 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 272 transitions, 3919 flow [2024-06-14 15:06:35,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:35,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:35,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:35,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:06:35,404 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:06:35,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1376588861, now seen corresponding path program 1 times [2024-06-14 15:06:35,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:35,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124725677] [2024-06-14 15:06:35,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124725677] [2024-06-14 15:06:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124725677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:06:43,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983889505] [2024-06-14 15:06:43,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:43,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:06:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:43,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:06:43,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:06:44,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:06:44,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 272 transitions, 3919 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:44,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:44,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:06:44,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:46,210 INFO L124 PetriNetUnfolderBase]: 3670/5549 cut-off events. [2024-06-14 15:06:46,210 INFO L125 PetriNetUnfolderBase]: For 471517/471517 co-relation queries the response was YES. [2024-06-14 15:06:46,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49259 conditions, 5549 events. 3670/5549 cut-off events. For 471517/471517 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 29643 event pairs, 710 based on Foata normal form. 24/5572 useless extension candidates. Maximal degree in co-relation 49165. Up to 4275 conditions per place. [2024-06-14 15:06:46,260 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 234 selfloop transitions, 84 changer transitions 0/321 dead transitions. [2024-06-14 15:06:46,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 321 transitions, 5289 flow [2024-06-14 15:06:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:06:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:06:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-14 15:06:46,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 15:06:46,262 INFO L175 Difference]: Start difference. First operand has 204 places, 272 transitions, 3919 flow. Second operand 9 states and 168 transitions. [2024-06-14 15:06:46,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 321 transitions, 5289 flow [2024-06-14 15:06:46,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 321 transitions, 5073 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-14 15:06:46,733 INFO L231 Difference]: Finished difference. Result has 206 places, 276 transitions, 4082 flow [2024-06-14 15:06:46,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3703, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4082, PETRI_PLACES=206, PETRI_TRANSITIONS=276} [2024-06-14 15:06:46,734 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 163 predicate places. [2024-06-14 15:06:46,734 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 276 transitions, 4082 flow [2024-06-14 15:06:46,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:46,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:46,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:46,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:06:46,734 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:06:46,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1106080986, now seen corresponding path program 1 times [2024-06-14 15:06:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:46,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411222711] [2024-06-14 15:06:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:00,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411222711] [2024-06-14 15:07:00,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411222711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:00,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:00,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:00,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696653300] [2024-06-14 15:07:00,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:00,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:00,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:00,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:00,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:07:00,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 276 transitions, 4082 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:00,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:00,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:07:00,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:02,469 INFO L124 PetriNetUnfolderBase]: 3675/5556 cut-off events. [2024-06-14 15:07:02,469 INFO L125 PetriNetUnfolderBase]: For 447480/447480 co-relation queries the response was YES. [2024-06-14 15:07:02,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49022 conditions, 5556 events. 3675/5556 cut-off events. For 447480/447480 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 29740 event pairs, 819 based on Foata normal form. 1/5556 useless extension candidates. Maximal degree in co-relation 48927. Up to 5507 conditions per place. [2024-06-14 15:07:02,515 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 276 selfloop transitions, 23 changer transitions 0/302 dead transitions. [2024-06-14 15:07:02,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 302 transitions, 4914 flow [2024-06-14 15:07:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:07:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:07:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-14 15:07:02,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-14 15:07:02,516 INFO L175 Difference]: Start difference. First operand has 206 places, 276 transitions, 4082 flow. Second operand 7 states and 112 transitions. [2024-06-14 15:07:02,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 302 transitions, 4914 flow [2024-06-14 15:07:03,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 302 transitions, 4730 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-14 15:07:03,030 INFO L231 Difference]: Finished difference. Result has 209 places, 285 transitions, 4058 flow [2024-06-14 15:07:03,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3898, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4058, PETRI_PLACES=209, PETRI_TRANSITIONS=285} [2024-06-14 15:07:03,030 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places. [2024-06-14 15:07:03,031 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 285 transitions, 4058 flow [2024-06-14 15:07:03,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:03,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:03,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:03,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:07:03,031 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:07:03,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:03,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1106080614, now seen corresponding path program 2 times [2024-06-14 15:07:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:03,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259159392] [2024-06-14 15:07:03,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:03,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259159392] [2024-06-14 15:07:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259159392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:16,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:16,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390494940] [2024-06-14 15:07:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:16,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:16,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:16,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:16,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:07:16,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 285 transitions, 4058 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:16,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:16,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:07:16,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:18,427 INFO L124 PetriNetUnfolderBase]: 3685/5570 cut-off events. [2024-06-14 15:07:18,427 INFO L125 PetriNetUnfolderBase]: For 450400/450400 co-relation queries the response was YES. [2024-06-14 15:07:18,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48907 conditions, 5570 events. 3685/5570 cut-off events. For 450400/450400 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 29802 event pairs, 818 based on Foata normal form. 2/5571 useless extension candidates. Maximal degree in co-relation 48809. Up to 5480 conditions per place. [2024-06-14 15:07:18,483 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 278 selfloop transitions, 36 changer transitions 0/317 dead transitions. [2024-06-14 15:07:18,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 317 transitions, 4979 flow [2024-06-14 15:07:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:07:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:07:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-14 15:07:18,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37566137566137564 [2024-06-14 15:07:18,484 INFO L175 Difference]: Start difference. First operand has 209 places, 285 transitions, 4058 flow. Second operand 9 states and 142 transitions. [2024-06-14 15:07:18,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 317 transitions, 4979 flow [2024-06-14 15:07:19,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 317 transitions, 4933 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-14 15:07:19,048 INFO L231 Difference]: Finished difference. Result has 216 places, 290 transitions, 4205 flow [2024-06-14 15:07:19,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4012, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4205, PETRI_PLACES=216, PETRI_TRANSITIONS=290} [2024-06-14 15:07:19,048 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places. [2024-06-14 15:07:19,048 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 290 transitions, 4205 flow [2024-06-14 15:07:19,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:19,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:19,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:19,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:07:19,049 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:07:19,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:19,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1685574819, now seen corresponding path program 2 times [2024-06-14 15:07:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876975514] [2024-06-14 15:07:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:28,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:28,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876975514] [2024-06-14 15:07:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876975514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:28,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:28,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:07:28,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439902770] [2024-06-14 15:07:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:28,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:07:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:07:28,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:07:28,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:07:28,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 290 transitions, 4205 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:28,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:28,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:07:28,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:31,028 INFO L124 PetriNetUnfolderBase]: 3929/5966 cut-off events. [2024-06-14 15:07:31,029 INFO L125 PetriNetUnfolderBase]: For 558957/558969 co-relation queries the response was YES. [2024-06-14 15:07:31,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54116 conditions, 5966 events. 3929/5966 cut-off events. For 558957/558969 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 32487 event pairs, 668 based on Foata normal form. 31/5996 useless extension candidates. Maximal degree in co-relation 54015. Up to 3253 conditions per place. [2024-06-14 15:07:31,080 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 175 selfloop transitions, 160 changer transitions 0/338 dead transitions. [2024-06-14 15:07:31,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 338 transitions, 5655 flow [2024-06-14 15:07:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:07:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:07:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-14 15:07:31,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2024-06-14 15:07:31,082 INFO L175 Difference]: Start difference. First operand has 216 places, 290 transitions, 4205 flow. Second operand 9 states and 169 transitions. [2024-06-14 15:07:31,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 338 transitions, 5655 flow [2024-06-14 15:07:31,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 338 transitions, 5551 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 15:07:31,588 INFO L231 Difference]: Finished difference. Result has 218 places, 294 transitions, 4640 flow [2024-06-14 15:07:31,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4101, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4640, PETRI_PLACES=218, PETRI_TRANSITIONS=294} [2024-06-14 15:07:31,589 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 175 predicate places. [2024-06-14 15:07:31,589 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 294 transitions, 4640 flow [2024-06-14 15:07:31,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:31,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:31,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:31,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:07:31,590 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:07:31,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash 60178099, now seen corresponding path program 3 times [2024-06-14 15:07:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470090034] [2024-06-14 15:07:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:40,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:40,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470090034] [2024-06-14 15:07:40,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470090034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:40,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:07:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000546292] [2024-06-14 15:07:40,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:07:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:07:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:07:40,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:07:40,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 294 transitions, 4640 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:40,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:40,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:07:40,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:43,373 INFO L124 PetriNetUnfolderBase]: 4065/6186 cut-off events. [2024-06-14 15:07:43,373 INFO L125 PetriNetUnfolderBase]: For 614171/614183 co-relation queries the response was YES. [2024-06-14 15:07:43,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57639 conditions, 6186 events. 4065/6186 cut-off events. For 614171/614183 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 34229 event pairs, 805 based on Foata normal form. 43/6228 useless extension candidates. Maximal degree in co-relation 57537. Up to 5018 conditions per place. [2024-06-14 15:07:43,440 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 191 selfloop transitions, 141 changer transitions 0/335 dead transitions. [2024-06-14 15:07:43,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 335 transitions, 5772 flow [2024-06-14 15:07:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:07:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:07:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-14 15:07:43,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 15:07:43,441 INFO L175 Difference]: Start difference. First operand has 218 places, 294 transitions, 4640 flow. Second operand 9 states and 168 transitions. [2024-06-14 15:07:43,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 335 transitions, 5772 flow [2024-06-14 15:07:44,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 335 transitions, 5502 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-14 15:07:44,187 INFO L231 Difference]: Finished difference. Result has 222 places, 297 transitions, 4800 flow [2024-06-14 15:07:44,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4370, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4800, PETRI_PLACES=222, PETRI_TRANSITIONS=297} [2024-06-14 15:07:44,188 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 179 predicate places. [2024-06-14 15:07:44,188 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 297 transitions, 4800 flow [2024-06-14 15:07:44,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:44,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:44,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:44,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:07:44,189 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:07:44,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1350090815, now seen corresponding path program 4 times [2024-06-14 15:07:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504227061] [2024-06-14 15:07:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:54,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504227061] [2024-06-14 15:07:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504227061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:54,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:07:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103660290] [2024-06-14 15:07:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:54,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:07:54,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:54,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:07:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:07:54,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:07:54,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 297 transitions, 4800 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:54,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:54,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:07:54,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:56,845 INFO L124 PetriNetUnfolderBase]: 4331/6616 cut-off events. [2024-06-14 15:07:56,845 INFO L125 PetriNetUnfolderBase]: For 675455/675467 co-relation queries the response was YES. [2024-06-14 15:07:56,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63558 conditions, 6616 events. 4331/6616 cut-off events. For 675455/675467 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 37185 event pairs, 898 based on Foata normal form. 31/6646 useless extension candidates. Maximal degree in co-relation 63454. Up to 4998 conditions per place. [2024-06-14 15:07:56,916 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 223 selfloop transitions, 120 changer transitions 0/346 dead transitions. [2024-06-14 15:07:56,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 346 transitions, 6414 flow [2024-06-14 15:07:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:07:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:07:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-14 15:07:56,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2024-06-14 15:07:56,918 INFO L175 Difference]: Start difference. First operand has 222 places, 297 transitions, 4800 flow. Second operand 9 states and 172 transitions. [2024-06-14 15:07:56,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 346 transitions, 6414 flow [2024-06-14 15:07:57,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 346 transitions, 6042 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-14 15:07:57,995 INFO L231 Difference]: Finished difference. Result has 224 places, 301 transitions, 4903 flow [2024-06-14 15:07:57,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4428, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4903, PETRI_PLACES=224, PETRI_TRANSITIONS=301} [2024-06-14 15:07:57,996 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places. [2024-06-14 15:07:57,996 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 301 transitions, 4903 flow [2024-06-14 15:07:57,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:57,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:57,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:57,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:07:57,997 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:07:57,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1350098255, now seen corresponding path program 5 times [2024-06-14 15:07:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104204112] [2024-06-14 15:07:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:07,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:07,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104204112] [2024-06-14 15:08:07,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104204112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:07,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:07,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:08:07,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903069706] [2024-06-14 15:08:07,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:08:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:08:07,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:08:07,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:08:07,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 301 transitions, 4903 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:07,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:07,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:08:07,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:09,998 INFO L124 PetriNetUnfolderBase]: 4407/6748 cut-off events. [2024-06-14 15:08:09,998 INFO L125 PetriNetUnfolderBase]: For 695912/695924 co-relation queries the response was YES. [2024-06-14 15:08:10,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63727 conditions, 6748 events. 4407/6748 cut-off events. For 695912/695924 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 38314 event pairs, 952 based on Foata normal form. 43/6790 useless extension candidates. Maximal degree in co-relation 63622. Up to 5562 conditions per place. [2024-06-14 15:08:10,088 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 221 selfloop transitions, 119 changer transitions 0/343 dead transitions. [2024-06-14 15:08:10,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 343 transitions, 6183 flow [2024-06-14 15:08:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:08:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:08:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-14 15:08:10,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2024-06-14 15:08:10,090 INFO L175 Difference]: Start difference. First operand has 224 places, 301 transitions, 4903 flow. Second operand 9 states and 169 transitions. [2024-06-14 15:08:10,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 343 transitions, 6183 flow [2024-06-14 15:08:11,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 343 transitions, 5947 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-14 15:08:11,179 INFO L231 Difference]: Finished difference. Result has 228 places, 304 transitions, 5063 flow [2024-06-14 15:08:11,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4671, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5063, PETRI_PLACES=228, PETRI_TRANSITIONS=304} [2024-06-14 15:08:11,180 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places. [2024-06-14 15:08:11,180 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 304 transitions, 5063 flow [2024-06-14 15:08:11,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:11,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:11,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:11,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:08:11,181 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:08:11,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1676378049, now seen corresponding path program 6 times [2024-06-14 15:08:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140450697] [2024-06-14 15:08:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140450697] [2024-06-14 15:08:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140450697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:08:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244444841] [2024-06-14 15:08:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:20,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:08:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:08:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:08:21,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:08:21,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 304 transitions, 5063 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:21,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:21,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:08:21,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:24,084 INFO L124 PetriNetUnfolderBase]: 4417/6774 cut-off events. [2024-06-14 15:08:24,084 INFO L125 PetriNetUnfolderBase]: For 677633/677645 co-relation queries the response was YES. [2024-06-14 15:08:24,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63647 conditions, 6774 events. 4417/6774 cut-off events. For 677633/677645 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 38614 event pairs, 898 based on Foata normal form. 31/6804 useless extension candidates. Maximal degree in co-relation 63540. Up to 5126 conditions per place. [2024-06-14 15:08:24,148 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 200 selfloop transitions, 146 changer transitions 0/349 dead transitions. [2024-06-14 15:08:24,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 349 transitions, 6453 flow [2024-06-14 15:08:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:08:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:08:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-14 15:08:24,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-14 15:08:24,149 INFO L175 Difference]: Start difference. First operand has 228 places, 304 transitions, 5063 flow. Second operand 9 states and 171 transitions. [2024-06-14 15:08:24,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 349 transitions, 6453 flow [2024-06-14 15:08:25,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 349 transitions, 6123 flow, removed 49 selfloop flow, removed 7 redundant places. [2024-06-14 15:08:25,082 INFO L231 Difference]: Finished difference. Result has 230 places, 306 transitions, 5149 flow [2024-06-14 15:08:25,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4733, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5149, PETRI_PLACES=230, PETRI_TRANSITIONS=306} [2024-06-14 15:08:25,083 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places. [2024-06-14 15:08:25,083 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 306 transitions, 5149 flow [2024-06-14 15:08:25,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:25,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:25,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:25,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:08:25,084 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:08:25,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1355812547, now seen corresponding path program 7 times [2024-06-14 15:08:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279636600] [2024-06-14 15:08:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:34,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:34,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279636600] [2024-06-14 15:08:34,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279636600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:34,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:34,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:08:34,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25335997] [2024-06-14 15:08:34,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:34,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:08:34,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:34,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:08:34,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:08:34,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:08:34,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 306 transitions, 5149 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:34,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:34,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:08:34,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:37,181 INFO L124 PetriNetUnfolderBase]: 4407/6760 cut-off events. [2024-06-14 15:08:37,182 INFO L125 PetriNetUnfolderBase]: For 641238/641250 co-relation queries the response was YES. [2024-06-14 15:08:37,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62497 conditions, 6760 events. 4407/6760 cut-off events. For 641238/641250 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 38476 event pairs, 942 based on Foata normal form. 13/6772 useless extension candidates. Maximal degree in co-relation 62389. Up to 5752 conditions per place. [2024-06-14 15:08:37,424 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 220 selfloop transitions, 122 changer transitions 0/345 dead transitions. [2024-06-14 15:08:37,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 345 transitions, 6535 flow [2024-06-14 15:08:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:08:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:08:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-14 15:08:37,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-14 15:08:37,426 INFO L175 Difference]: Start difference. First operand has 230 places, 306 transitions, 5149 flow. Second operand 9 states and 165 transitions. [2024-06-14 15:08:37,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 345 transitions, 6535 flow [2024-06-14 15:08:38,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 345 transitions, 5960 flow, removed 54 selfloop flow, removed 9 redundant places. [2024-06-14 15:08:38,263 INFO L231 Difference]: Finished difference. Result has 230 places, 309 transitions, 4976 flow [2024-06-14 15:08:38,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4578, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4976, PETRI_PLACES=230, PETRI_TRANSITIONS=309} [2024-06-14 15:08:38,263 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places. [2024-06-14 15:08:38,263 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 309 transitions, 4976 flow [2024-06-14 15:08:38,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:38,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:38,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:38,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:08:38,264 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:08:38,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1322958519, now seen corresponding path program 8 times [2024-06-14 15:08:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850860914] [2024-06-14 15:08:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:47,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:47,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850860914] [2024-06-14 15:08:47,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850860914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:47,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:47,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:08:47,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220172846] [2024-06-14 15:08:47,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:47,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:08:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:08:47,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:08:47,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:08:47,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 309 transitions, 4976 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:47,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:47,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:08:47,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:50,277 INFO L124 PetriNetUnfolderBase]: 4469/6854 cut-off events. [2024-06-14 15:08:50,277 INFO L125 PetriNetUnfolderBase]: For 650307/650319 co-relation queries the response was YES. [2024-06-14 15:08:50,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61869 conditions, 6854 events. 4469/6854 cut-off events. For 650307/650319 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 39138 event pairs, 958 based on Foata normal form. 13/6866 useless extension candidates. Maximal degree in co-relation 61762. Up to 5256 conditions per place. [2024-06-14 15:08:50,350 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 224 selfloop transitions, 129 changer transitions 0/356 dead transitions. [2024-06-14 15:08:50,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 356 transitions, 6630 flow [2024-06-14 15:08:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:08:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:08:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-14 15:08:50,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497354497354497 [2024-06-14 15:08:50,352 INFO L175 Difference]: Start difference. First operand has 230 places, 309 transitions, 4976 flow. Second operand 9 states and 170 transitions. [2024-06-14 15:08:50,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 356 transitions, 6630 flow [2024-06-14 15:08:51,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 356 transitions, 6260 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-14 15:08:51,349 INFO L231 Difference]: Finished difference. Result has 233 places, 315 transitions, 5137 flow [2024-06-14 15:08:51,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4606, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5137, PETRI_PLACES=233, PETRI_TRANSITIONS=315} [2024-06-14 15:08:51,350 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places. [2024-06-14 15:08:51,350 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 315 transitions, 5137 flow [2024-06-14 15:08:51,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:51,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:51,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:51,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:08:51,351 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:08:51,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash 764012292, now seen corresponding path program 2 times [2024-06-14 15:08:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:51,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19381914] [2024-06-14 15:08:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:51,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19381914] [2024-06-14 15:09:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19381914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:05,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:05,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712052155] [2024-06-14 15:09:05,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:05,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:05,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:05,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:05,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:09:05,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 315 transitions, 5137 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:05,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:05,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:09:05,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:07,656 INFO L124 PetriNetUnfolderBase]: 4474/6859 cut-off events. [2024-06-14 15:09:07,657 INFO L125 PetriNetUnfolderBase]: For 668107/668119 co-relation queries the response was YES. [2024-06-14 15:09:07,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62399 conditions, 6859 events. 4474/6859 cut-off events. For 668107/668119 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 39301 event pairs, 1077 based on Foata normal form. 13/6871 useless extension candidates. Maximal degree in co-relation 62290. Up to 6807 conditions per place. [2024-06-14 15:09:07,730 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 299 selfloop transitions, 27 changer transitions 0/329 dead transitions. [2024-06-14 15:09:07,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 329 transitions, 5975 flow [2024-06-14 15:09:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-14 15:09:07,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-14 15:09:07,732 INFO L175 Difference]: Start difference. First operand has 233 places, 315 transitions, 5137 flow. Second operand 7 states and 105 transitions. [2024-06-14 15:09:07,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 329 transitions, 5975 flow [2024-06-14 15:09:08,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 329 transitions, 5651 flow, removed 88 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:08,654 INFO L231 Difference]: Finished difference. Result has 235 places, 318 transitions, 4913 flow [2024-06-14 15:09:08,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4813, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4913, PETRI_PLACES=235, PETRI_TRANSITIONS=318} [2024-06-14 15:09:08,655 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places. [2024-06-14 15:09:08,655 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 318 transitions, 4913 flow [2024-06-14 15:09:08,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:08,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:08,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:08,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:09:08,656 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:09:08,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash -150689580, now seen corresponding path program 3 times [2024-06-14 15:09:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839333346] [2024-06-14 15:09:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:08,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839333346] [2024-06-14 15:09:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839333346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878766685] [2024-06-14 15:09:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:21,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:21,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:22,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:09:22,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 318 transitions, 4913 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:22,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:22,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:09:22,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:24,757 INFO L124 PetriNetUnfolderBase]: 4468/6851 cut-off events. [2024-06-14 15:09:24,758 INFO L125 PetriNetUnfolderBase]: For 671384/671396 co-relation queries the response was YES. [2024-06-14 15:09:24,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61518 conditions, 6851 events. 4468/6851 cut-off events. For 671384/671396 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 39223 event pairs, 1076 based on Foata normal form. 14/6864 useless extension candidates. Maximal degree in co-relation 61407. Up to 6762 conditions per place. [2024-06-14 15:09:24,827 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 298 selfloop transitions, 36 changer transitions 0/337 dead transitions. [2024-06-14 15:09:24,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 337 transitions, 5632 flow [2024-06-14 15:09:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:09:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:09:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2024-06-14 15:09:24,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3544973544973545 [2024-06-14 15:09:24,829 INFO L175 Difference]: Start difference. First operand has 235 places, 318 transitions, 4913 flow. Second operand 9 states and 134 transitions. [2024-06-14 15:09:24,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 337 transitions, 5632 flow [2024-06-14 15:09:25,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 337 transitions, 5534 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:25,688 INFO L231 Difference]: Finished difference. Result has 240 places, 318 transitions, 4895 flow [2024-06-14 15:09:25,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4815, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4895, PETRI_PLACES=240, PETRI_TRANSITIONS=318} [2024-06-14 15:09:25,696 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places. [2024-06-14 15:09:25,696 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 318 transitions, 4895 flow [2024-06-14 15:09:25,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:25,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:25,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:25,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:09:25,697 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:09:25,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2086010854, now seen corresponding path program 3 times [2024-06-14 15:09:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:25,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697582206] [2024-06-14 15:09:25,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697582206] [2024-06-14 15:09:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697582206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:39,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:39,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534430665] [2024-06-14 15:09:39,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:39,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:39,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:39,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:09:39,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 318 transitions, 4895 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:39,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:39,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:09:39,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:42,205 INFO L124 PetriNetUnfolderBase]: 4465/6847 cut-off events. [2024-06-14 15:09:42,208 INFO L125 PetriNetUnfolderBase]: For 685426/685434 co-relation queries the response was YES. [2024-06-14 15:09:42,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61717 conditions, 6847 events. 4465/6847 cut-off events. For 685426/685434 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 39226 event pairs, 1076 based on Foata normal form. 9/6855 useless extension candidates. Maximal degree in co-relation 61605. Up to 6796 conditions per place. [2024-06-14 15:09:42,275 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 299 selfloop transitions, 26 changer transitions 0/328 dead transitions. [2024-06-14 15:09:42,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 328 transitions, 5569 flow [2024-06-14 15:09:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-14 15:09:42,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-14 15:09:42,277 INFO L175 Difference]: Start difference. First operand has 240 places, 318 transitions, 4895 flow. Second operand 7 states and 105 transitions. [2024-06-14 15:09:42,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 328 transitions, 5569 flow [2024-06-14 15:09:43,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 328 transitions, 5463 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-14 15:09:43,131 INFO L231 Difference]: Finished difference. Result has 239 places, 318 transitions, 4847 flow [2024-06-14 15:09:43,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4789, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4847, PETRI_PLACES=239, PETRI_TRANSITIONS=318} [2024-06-14 15:09:43,132 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places. [2024-06-14 15:09:43,132 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 318 transitions, 4847 flow [2024-06-14 15:09:43,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:43,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:43,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:43,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:09:43,133 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:09:43,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:43,133 INFO L85 PathProgramCache]: Analyzing trace with hash -156933786, now seen corresponding path program 1 times [2024-06-14 15:09:43,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:43,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501649883] [2024-06-14 15:09:43,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:53,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:53,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501649883] [2024-06-14 15:09:53,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501649883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:53,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:53,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092338951] [2024-06-14 15:09:53,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:53,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:53,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:53,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:53,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:09:53,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 318 transitions, 4847 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:53,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:53,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:09:53,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:55,619 INFO L124 PetriNetUnfolderBase]: 4305/6698 cut-off events. [2024-06-14 15:09:55,619 INFO L125 PetriNetUnfolderBase]: For 639550/639550 co-relation queries the response was YES. [2024-06-14 15:09:55,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59105 conditions, 6698 events. 4305/6698 cut-off events. For 639550/639550 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39225 event pairs, 994 based on Foata normal form. 4/6695 useless extension candidates. Maximal degree in co-relation 58992. Up to 6502 conditions per place. [2024-06-14 15:09:55,698 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 309 selfloop transitions, 28 changer transitions 0/345 dead transitions. [2024-06-14 15:09:55,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 345 transitions, 5879 flow [2024-06-14 15:09:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-14 15:09:55,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2024-06-14 15:09:55,699 INFO L175 Difference]: Start difference. First operand has 239 places, 318 transitions, 4847 flow. Second operand 7 states and 120 transitions. [2024-06-14 15:09:55,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 345 transitions, 5879 flow [2024-06-14 15:09:56,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 345 transitions, 5829 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:56,788 INFO L231 Difference]: Finished difference. Result has 242 places, 328 transitions, 5040 flow [2024-06-14 15:09:56,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4797, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5040, PETRI_PLACES=242, PETRI_TRANSITIONS=328} [2024-06-14 15:09:56,788 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 199 predicate places. [2024-06-14 15:09:56,789 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 328 transitions, 5040 flow [2024-06-14 15:09:56,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:56,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:56,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:56,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:09:56,789 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:09:56,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash 763781094, now seen corresponding path program 2 times [2024-06-14 15:09:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398718411] [2024-06-14 15:09:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398718411] [2024-06-14 15:10:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398718411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:10:06,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834762014] [2024-06-14 15:10:06,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:06,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:10:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:06,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:10:06,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:10:06,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:10:06,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 328 transitions, 5040 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:06,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:06,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:10:06,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:09,218 INFO L124 PetriNetUnfolderBase]: 4315/6716 cut-off events. [2024-06-14 15:10:09,218 INFO L125 PetriNetUnfolderBase]: For 656329/656329 co-relation queries the response was YES. [2024-06-14 15:10:09,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60053 conditions, 6716 events. 4315/6716 cut-off events. For 656329/656329 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39361 event pairs, 992 based on Foata normal form. 2/6711 useless extension candidates. Maximal degree in co-relation 59938. Up to 6572 conditions per place. [2024-06-14 15:10:09,285 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 318 selfloop transitions, 21 changer transitions 0/347 dead transitions. [2024-06-14 15:10:09,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 347 transitions, 6008 flow [2024-06-14 15:10:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:10:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:10:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-14 15:10:09,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-14 15:10:09,287 INFO L175 Difference]: Start difference. First operand has 242 places, 328 transitions, 5040 flow. Second operand 7 states and 112 transitions. [2024-06-14 15:10:09,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 347 transitions, 6008 flow [2024-06-14 15:10:10,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 347 transitions, 5906 flow, removed 47 selfloop flow, removed 2 redundant places. [2024-06-14 15:10:10,121 INFO L231 Difference]: Finished difference. Result has 247 places, 334 transitions, 5120 flow [2024-06-14 15:10:10,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4938, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5120, PETRI_PLACES=247, PETRI_TRANSITIONS=334} [2024-06-14 15:10:10,122 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2024-06-14 15:10:10,122 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 334 transitions, 5120 flow [2024-06-14 15:10:10,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:10,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:10,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:10,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:10:10,123 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:10:10,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1864448730, now seen corresponding path program 3 times [2024-06-14 15:10:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:10,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588373752] [2024-06-14 15:10:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:19,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-06-14 15:10:19,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:19,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588373752] [2024-06-14 15:10:19,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588373752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:19,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:19,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:10:19,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099824262] [2024-06-14 15:10:19,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:19,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:10:19,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:19,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:10:19,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:10:20,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-14 15:10:20,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 334 transitions, 5120 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:20,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:20,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-14 15:10:20,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:22,480 INFO L124 PetriNetUnfolderBase]: 4324/6725 cut-off events. [2024-06-14 15:10:22,480 INFO L125 PetriNetUnfolderBase]: For 673259/673259 co-relation queries the response was YES. [2024-06-14 15:10:22,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60276 conditions, 6725 events. 4324/6725 cut-off events. For 673259/673259 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39438 event pairs, 993 based on Foata normal form. 3/6719 useless extension candidates. Maximal degree in co-relation 60158. Up to 6594 conditions per place. [2024-06-14 15:10:22,556 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 321 selfloop transitions, 16 changer transitions 0/345 dead transitions. [2024-06-14 15:10:22,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 345 transitions, 5822 flow [2024-06-14 15:10:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:10:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:10:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-14 15:10:22,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3673469387755102 [2024-06-14 15:10:22,557 INFO L175 Difference]: Start difference. First operand has 247 places, 334 transitions, 5120 flow. Second operand 7 states and 108 transitions. [2024-06-14 15:10:22,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 345 transitions, 5822 flow [2024-06-14 15:10:23,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 345 transitions, 5704 flow, removed 51 selfloop flow, removed 3 redundant places. [2024-06-14 15:10:23,636 INFO L231 Difference]: Finished difference. Result has 251 places, 334 transitions, 5041 flow [2024-06-14 15:10:23,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5002, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5041, PETRI_PLACES=251, PETRI_TRANSITIONS=334} [2024-06-14 15:10:23,637 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places. [2024-06-14 15:10:23,637 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 334 transitions, 5041 flow [2024-06-14 15:10:23,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:23,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:23,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:23,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:10:23,637 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:10:23,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1773272884, now seen corresponding path program 1 times [2024-06-14 15:10:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:23,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245997890] [2024-06-14 15:10:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:23,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:33,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:33,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245997890] [2024-06-14 15:10:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245997890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:33,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:33,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914192233] [2024-06-14 15:10:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:33,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:33,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:33,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:10:33,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 334 transitions, 5041 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:33,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:33,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:10:33,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:36,207 INFO L124 PetriNetUnfolderBase]: 4585/7034 cut-off events. [2024-06-14 15:10:36,207 INFO L125 PetriNetUnfolderBase]: For 803508/803508 co-relation queries the response was YES. [2024-06-14 15:10:36,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64664 conditions, 7034 events. 4585/7034 cut-off events. For 803508/803508 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 40269 event pairs, 901 based on Foata normal form. 18/7051 useless extension candidates. Maximal degree in co-relation 64545. Up to 6713 conditions per place. [2024-06-14 15:10:36,286 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 329 selfloop transitions, 42 changer transitions 0/374 dead transitions. [2024-06-14 15:10:36,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 374 transitions, 6253 flow [2024-06-14 15:10:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:10:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:10:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-14 15:10:36,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-14 15:10:36,288 INFO L175 Difference]: Start difference. First operand has 251 places, 334 transitions, 5041 flow. Second operand 9 states and 154 transitions. [2024-06-14 15:10:36,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 374 transitions, 6253 flow [2024-06-14 15:10:37,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 374 transitions, 6207 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:37,536 INFO L231 Difference]: Finished difference. Result has 254 places, 336 transitions, 5198 flow [2024-06-14 15:10:37,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4995, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5198, PETRI_PLACES=254, PETRI_TRANSITIONS=336} [2024-06-14 15:10:37,536 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places. [2024-06-14 15:10:37,536 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 336 transitions, 5198 flow [2024-06-14 15:10:37,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:37,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:37,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:10:37,537 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:10:37,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash -945565596, now seen corresponding path program 2 times [2024-06-14 15:10:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:37,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764059975] [2024-06-14 15:10:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764059975] [2024-06-14 15:10:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764059975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:47,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:10:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6918931] [2024-06-14 15:10:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:47,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:10:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:10:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:10:47,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:10:47,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 336 transitions, 5198 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:47,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:47,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:10:47,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:50,612 INFO L124 PetriNetUnfolderBase]: 4653/7150 cut-off events. [2024-06-14 15:10:50,612 INFO L125 PetriNetUnfolderBase]: For 830507/830507 co-relation queries the response was YES. [2024-06-14 15:10:50,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66129 conditions, 7150 events. 4653/7150 cut-off events. For 830507/830507 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 41441 event pairs, 1075 based on Foata normal form. 18/7167 useless extension candidates. Maximal degree in co-relation 66009. Up to 6811 conditions per place. [2024-06-14 15:10:50,682 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 321 selfloop transitions, 58 changer transitions 0/382 dead transitions. [2024-06-14 15:10:50,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 382 transitions, 6306 flow [2024-06-14 15:10:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:10:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:10:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-14 15:10:50,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2024-06-14 15:10:50,684 INFO L175 Difference]: Start difference. First operand has 254 places, 336 transitions, 5198 flow. Second operand 10 states and 172 transitions. [2024-06-14 15:10:50,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 382 transitions, 6306 flow [2024-06-14 15:10:51,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 382 transitions, 6133 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-14 15:10:51,696 INFO L231 Difference]: Finished difference. Result has 257 places, 338 transitions, 5250 flow [2024-06-14 15:10:51,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5025, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5250, PETRI_PLACES=257, PETRI_TRANSITIONS=338} [2024-06-14 15:10:51,696 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 214 predicate places. [2024-06-14 15:10:51,697 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 338 transitions, 5250 flow [2024-06-14 15:10:51,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:51,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:51,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:51,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:10:51,697 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:10:51,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1715180434, now seen corresponding path program 3 times [2024-06-14 15:10:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404327337] [2024-06-14 15:10:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:01,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:01,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404327337] [2024-06-14 15:11:01,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404327337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:01,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:01,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642808843] [2024-06-14 15:11:01,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:01,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:01,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:01,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:11:01,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 338 transitions, 5250 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:01,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:01,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:11:01,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:04,333 INFO L124 PetriNetUnfolderBase]: 4721/7266 cut-off events. [2024-06-14 15:11:04,333 INFO L125 PetriNetUnfolderBase]: For 864487/864487 co-relation queries the response was YES. [2024-06-14 15:11:04,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67030 conditions, 7266 events. 4721/7266 cut-off events. For 864487/864487 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 42366 event pairs, 1074 based on Foata normal form. 18/7283 useless extension candidates. Maximal degree in co-relation 66909. Up to 6532 conditions per place. [2024-06-14 15:11:04,408 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 298 selfloop transitions, 80 changer transitions 0/381 dead transitions. [2024-06-14 15:11:04,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 381 transitions, 6552 flow [2024-06-14 15:11:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 15:11:04,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41534391534391535 [2024-06-14 15:11:04,410 INFO L175 Difference]: Start difference. First operand has 257 places, 338 transitions, 5250 flow. Second operand 9 states and 157 transitions. [2024-06-14 15:11:04,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 381 transitions, 6552 flow [2024-06-14 15:11:05,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 381 transitions, 6383 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-14 15:11:05,474 INFO L231 Difference]: Finished difference. Result has 260 places, 342 transitions, 5437 flow [2024-06-14 15:11:05,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5081, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5437, PETRI_PLACES=260, PETRI_TRANSITIONS=342} [2024-06-14 15:11:05,474 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 217 predicate places. [2024-06-14 15:11:05,475 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 342 transitions, 5437 flow [2024-06-14 15:11:05,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:05,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:05,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:05,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:11:05,475 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:11:05,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash -82923890, now seen corresponding path program 1 times [2024-06-14 15:11:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:05,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579837996] [2024-06-14 15:11:05,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:05,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:19,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:19,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579837996] [2024-06-14 15:11:19,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579837996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:19,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:19,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:19,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48465601] [2024-06-14 15:11:19,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:19,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:19,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:19,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:19,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:19,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:11:19,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 342 transitions, 5437 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:19,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:19,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:11:19,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:22,621 INFO L124 PetriNetUnfolderBase]: 4731/7280 cut-off events. [2024-06-14 15:11:22,621 INFO L125 PetriNetUnfolderBase]: For 850228/850228 co-relation queries the response was YES. [2024-06-14 15:11:22,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67467 conditions, 7280 events. 4731/7280 cut-off events. For 850228/850228 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 42362 event pairs, 1137 based on Foata normal form. 2/7281 useless extension candidates. Maximal degree in co-relation 67344. Up to 7152 conditions per place. [2024-06-14 15:11:22,695 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 326 selfloop transitions, 46 changer transitions 0/375 dead transitions. [2024-06-14 15:11:22,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 375 transitions, 6470 flow [2024-06-14 15:11:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:11:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:11:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-14 15:11:22,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2024-06-14 15:11:22,698 INFO L175 Difference]: Start difference. First operand has 260 places, 342 transitions, 5437 flow. Second operand 8 states and 134 transitions. [2024-06-14 15:11:22,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 375 transitions, 6470 flow [2024-06-14 15:11:23,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 375 transitions, 6236 flow, removed 52 selfloop flow, removed 6 redundant places. [2024-06-14 15:11:23,843 INFO L231 Difference]: Finished difference. Result has 262 places, 348 transitions, 5384 flow [2024-06-14 15:11:23,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5203, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5384, PETRI_PLACES=262, PETRI_TRANSITIONS=348} [2024-06-14 15:11:23,844 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places. [2024-06-14 15:11:23,844 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 348 transitions, 5384 flow [2024-06-14 15:11:23,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:23,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:23,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:23,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:11:23,844 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:11:23,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash -79379753, now seen corresponding path program 1 times [2024-06-14 15:11:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798859108] [2024-06-14 15:11:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798859108] [2024-06-14 15:11:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798859108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:33,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:11:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376544158] [2024-06-14 15:11:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:33,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:11:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:11:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:11:34,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:11:34,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 348 transitions, 5384 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:34,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:34,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:11:34,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:36,672 INFO L124 PetriNetUnfolderBase]: 4733/7283 cut-off events. [2024-06-14 15:11:36,673 INFO L125 PetriNetUnfolderBase]: For 858210/858210 co-relation queries the response was YES. [2024-06-14 15:11:36,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67203 conditions, 7283 events. 4733/7283 cut-off events. For 858210/858210 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 42416 event pairs, 1134 based on Foata normal form. 2/7284 useless extension candidates. Maximal degree in co-relation 67079. Up to 7210 conditions per place. [2024-06-14 15:11:36,754 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 341 selfloop transitions, 27 changer transitions 0/371 dead transitions. [2024-06-14 15:11:36,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 371 transitions, 6377 flow [2024-06-14 15:11:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:11:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:11:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-14 15:11:36,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-06-14 15:11:36,756 INFO L175 Difference]: Start difference. First operand has 262 places, 348 transitions, 5384 flow. Second operand 7 states and 116 transitions. [2024-06-14 15:11:36,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 371 transitions, 6377 flow [2024-06-14 15:11:38,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 371 transitions, 6304 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-14 15:11:38,089 INFO L231 Difference]: Finished difference. Result has 265 places, 351 transitions, 5442 flow [2024-06-14 15:11:38,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5311, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5442, PETRI_PLACES=265, PETRI_TRANSITIONS=351} [2024-06-14 15:11:38,090 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 222 predicate places. [2024-06-14 15:11:38,090 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 351 transitions, 5442 flow [2024-06-14 15:11:38,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:38,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:38,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:38,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:11:38,091 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:11:38,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -73665833, now seen corresponding path program 2 times [2024-06-14 15:11:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867709237] [2024-06-14 15:11:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:48,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:48,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867709237] [2024-06-14 15:11:48,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867709237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:48,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:48,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:11:48,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377615715] [2024-06-14 15:11:48,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:48,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:11:48,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:48,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:11:48,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:11:48,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:11:48,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 351 transitions, 5442 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:48,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:48,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:11:48,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:51,140 INFO L124 PetriNetUnfolderBase]: 4738/7290 cut-off events. [2024-06-14 15:11:51,140 INFO L125 PetriNetUnfolderBase]: For 875576/875576 co-relation queries the response was YES. [2024-06-14 15:11:51,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67603 conditions, 7290 events. 4738/7290 cut-off events. For 875576/875576 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 42473 event pairs, 1134 based on Foata normal form. 1/7290 useless extension candidates. Maximal degree in co-relation 67477. Up to 7250 conditions per place. [2024-06-14 15:11:51,216 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 348 selfloop transitions, 19 changer transitions 0/370 dead transitions. [2024-06-14 15:11:51,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 370 transitions, 6289 flow [2024-06-14 15:11:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:11:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:11:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 15:11:51,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3707482993197279 [2024-06-14 15:11:51,219 INFO L175 Difference]: Start difference. First operand has 265 places, 351 transitions, 5442 flow. Second operand 7 states and 109 transitions. [2024-06-14 15:11:51,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 370 transitions, 6289 flow [2024-06-14 15:11:52,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 370 transitions, 6235 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:11:52,184 INFO L231 Difference]: Finished difference. Result has 268 places, 354 transitions, 5511 flow [2024-06-14 15:11:52,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5390, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5511, PETRI_PLACES=268, PETRI_TRANSITIONS=354} [2024-06-14 15:11:52,184 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 225 predicate places. [2024-06-14 15:11:52,184 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 354 transitions, 5511 flow [2024-06-14 15:11:52,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:52,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:52,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:52,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:11:52,185 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:11:52,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash -40430106, now seen corresponding path program 4 times [2024-06-14 15:11:52,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:52,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147827672] [2024-06-14 15:11:52,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:52,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:12:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147827672] [2024-06-14 15:12:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147827672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:12:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212393769] [2024-06-14 15:12:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:00,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:12:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:00,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:12:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:12:00,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-14 15:12:00,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 354 transitions, 5511 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:00,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:00,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-14 15:12:00,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:03,235 INFO L124 PetriNetUnfolderBase]: 4712/7252 cut-off events. [2024-06-14 15:12:03,235 INFO L125 PetriNetUnfolderBase]: For 894625/894625 co-relation queries the response was YES. [2024-06-14 15:12:03,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66379 conditions, 7252 events. 4712/7252 cut-off events. For 894625/894625 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 42190 event pairs, 1040 based on Foata normal form. 18/7269 useless extension candidates. Maximal degree in co-relation 66252. Up to 6591 conditions per place. [2024-06-14 15:12:03,322 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 301 selfloop transitions, 88 changer transitions 0/392 dead transitions. [2024-06-14 15:12:03,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 392 transitions, 6553 flow [2024-06-14 15:12:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-14 15:12:03,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41534391534391535 [2024-06-14 15:12:03,323 INFO L175 Difference]: Start difference. First operand has 268 places, 354 transitions, 5511 flow. Second operand 9 states and 157 transitions. [2024-06-14 15:12:03,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 392 transitions, 6553 flow Killed by 15