./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi000_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/rfi000_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/rfi000_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi000_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 15:35:39,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:35:39,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:35:39,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:35:39,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:35:39,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:35:39,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:35:39,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:35:39,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:35:39,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:35:39,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:35:39,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:35:39,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:35:39,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:35:39,940 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:35:39,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:35:39,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:35:39,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:35:39,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:35:39,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:35:39,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:35:39,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:35:39,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:35:39,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:35:39,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:35:39,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:35:39,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:35:39,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:35:39,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:35:39,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:35:39,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:35:39,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:35:39,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:35:39,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:35:39,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:35:39,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:35:39,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:35:39,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:35:39,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:35:39,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:35:39,946 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:35:39,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:35:39,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:35:39,947 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:35:40,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:35:40,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:35:40,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:35:40,160 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:35:40,160 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:35:40,161 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/rfi000_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-14 15:35:40,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:35:40,267 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:35:40,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-14 15:35:41,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:35:41,666 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:35:41,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-14 15:35:41,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f35f2bf/66bd8b7fa7304e03874708bf50b79bce/FLAG3aa35be51 [2024-06-14 15:35:41,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f35f2bf/66bd8b7fa7304e03874708bf50b79bce [2024-06-14 15:35:41,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:35:41,691 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:35:41,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:35:41,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:35:41,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:35:41,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:35:40" (1/2) ... [2024-06-14 15:35:41,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b259dc7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:35:41, skipping insertion in model container [2024-06-14 15:35:41,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:35:40" (1/2) ... [2024-06-14 15:35:41,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e09e3a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:35:41, skipping insertion in model container [2024-06-14 15:35:41,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:35:41" (2/2) ... [2024-06-14 15:35:41,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b259dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:41, skipping insertion in model container [2024-06-14 15:35:41,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:35:41" (2/2) ... [2024-06-14 15:35:41,701 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:35:41,751 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:35:41,753 INFO L97 edCorrectnessWitness]: Location invariant before [L804-L804] (((((((((((((((! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 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_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:35:41,753 INFO L97 edCorrectnessWitness]: Location invariant before [L803-L803] (((((((((((((((! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 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_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:35:41,754 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:35:41,754 INFO L106 edCorrectnessWitness]: ghost_update [L801-L801] multithreaded = 1; [2024-06-14 15:35:41,791 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:35:42,119 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:35:42,128 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:35:42,346 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:35:42,373 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:35:42,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42 WrapperNode [2024-06-14 15:35:42,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:35:42,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:35:42,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:35:42,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:35:42,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,505 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-06-14 15:35:42,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:35:42,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:35:42,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:35:42,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:35:42,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,565 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 15:35:42,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:35:42,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:35:42,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:35:42,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:35:42,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (1/1) ... [2024-06-14 15:35:42,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:35:42,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:35:42,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 15:35:42,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 15:35:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:35:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:35:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:35:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:35:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:35:42,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:35:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:35:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:35:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:35:42,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:35:42,693 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:35:42,826 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:35:42,828 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:35:43,381 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:35:43,381 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:35:43,502 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:35:43,503 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:35:43,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:35:43 BoogieIcfgContainer [2024-06-14 15:35:43,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:35:43,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:35:43,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:35:43,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:35:43,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:35:40" (1/4) ... [2024-06-14 15:35:43,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d01aaf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:35:43, skipping insertion in model container [2024-06-14 15:35:43,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:35:41" (2/4) ... [2024-06-14 15:35:43,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d01aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:35:43, skipping insertion in model container [2024-06-14 15:35:43,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:35:42" (3/4) ... [2024-06-14 15:35:43,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d01aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:35:43, skipping insertion in model container [2024-06-14 15:35:43,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:35:43" (4/4) ... [2024-06-14 15:35:43,518 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-14 15:35:43,531 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:35:43,532 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:35:43,532 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:35:43,619 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:35:43,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:35:43,691 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 15:35:43,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:35:43,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:35:43,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:35:43,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 15:35:43,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:35:43,720 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;@1bc90213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:35:43,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:35:43,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:35:43,729 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:35:43,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:35:43,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:43,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:35:43,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:35:43,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:43,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1600259855, now seen corresponding path program 1 times [2024-06-14 15:35:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:43,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834562067] [2024-06-14 15:35:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:43,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:47,131 INFO 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:35:47,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834562067] [2024-06-14 15:35:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834562067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:47,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:47,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:35:47,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439535982] [2024-06-14 15:35:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:47,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:35:47,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:35:47,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:35:47,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:35:47,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:35:47,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:47,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:35:47,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:47,403 INFO L124 PetriNetUnfolderBase]: 162/317 cut-off events. [2024-06-14 15:35:47,403 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 15:35:47,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 317 events. 162/317 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1162 event pairs, 97 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 616. Up to 288 conditions per place. [2024-06-14 15:35:47,408 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:35:47,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-14 15:35:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:35:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:35:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-14 15:35:47,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-14 15:35:47,420 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 52 transitions. [2024-06-14 15:35:47,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-14 15:35:47,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:35:47,424 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 15:35:47,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 15:35:47,429 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 15:35:47,429 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 15:35:47,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:35:47,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:47,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:47,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:35:47,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:35:47,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash 251680094, now seen corresponding path program 1 times [2024-06-14 15:35:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729510815] [2024-06-14 15:35:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:49,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729510815] [2024-06-14 15:35:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729510815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:49,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:49,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:35:49,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371870068] [2024-06-14 15:35:49,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:49,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:35:49,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:49,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:35:49,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:35:49,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:35:49,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:35:49,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:49,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:35:49,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:49,853 INFO L124 PetriNetUnfolderBase]: 213/382 cut-off events. [2024-06-14 15:35:49,853 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-06-14 15:35:49,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 382 events. 213/382 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1350 event pairs, 109 based on Foata normal form. 2/382 useless extension candidates. Maximal degree in co-relation 865. Up to 364 conditions per place. [2024-06-14 15:35:49,856 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 29 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 15:35:49,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 167 flow [2024-06-14 15:35:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:35:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:35:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-06-14 15:35:49,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-14 15:35:49,858 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 60 transitions. [2024-06-14 15:35:49,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 167 flow [2024-06-14 15:35:49,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:35:49,859 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 15:35:49,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 15:35:49,860 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 15:35:49,861 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 15:35:49,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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:35:49,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:49,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:49,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:35:49,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:35:49,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash -795000808, now seen corresponding path program 1 times [2024-06-14 15:35:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:49,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108439841] [2024-06-14 15:35:49,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:51,814 INFO 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:35:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108439841] [2024-06-14 15:35:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108439841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:51,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:35:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982746852] [2024-06-14 15:35:51,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:51,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:35:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:51,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:35:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:35:51,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:35:51,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:35:51,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:51,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:35:51,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:52,036 INFO L124 PetriNetUnfolderBase]: 207/372 cut-off events. [2024-06-14 15:35:52,036 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-06-14 15:35:52,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 372 events. 207/372 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1297 event pairs, 61 based on Foata normal form. 4/374 useless extension candidates. Maximal degree in co-relation 930. Up to 336 conditions per place. [2024-06-14 15:35:52,039 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 34 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-14 15:35:52,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 219 flow [2024-06-14 15:35:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:35:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:35:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-06-14 15:35:52,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-06-14 15:35:52,041 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 73 transitions. [2024-06-14 15:35:52,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 219 flow [2024-06-14 15:35:52,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:35:52,042 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-14 15:35:52,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-14 15:35:52,043 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-14 15:35:52,043 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-14 15:35:52,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:35:52,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:52,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:52,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:35:52,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:35:52,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 508425943, now seen corresponding path program 1 times [2024-06-14 15:35:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947501801] [2024-06-14 15:35:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947501801] [2024-06-14 15:35:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947501801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:54,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:54,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:35:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555331406] [2024-06-14 15:35:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:54,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:35:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:54,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:35:54,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:35:54,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:35:54,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:54,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:54,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:35:54,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:54,988 INFO L124 PetriNetUnfolderBase]: 203/364 cut-off events. [2024-06-14 15:35:54,989 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2024-06-14 15:35:54,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 364 events. 203/364 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1244 event pairs, 36 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 990. Up to 310 conditions per place. [2024-06-14 15:35:54,992 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 34 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-14 15:35:54,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 233 flow [2024-06-14 15:35:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:35:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:35:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-06-14 15:35:54,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:35:54,996 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 80 transitions. [2024-06-14 15:35:54,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 233 flow [2024-06-14 15:35:54,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 218 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:35:54,998 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 118 flow [2024-06-14 15:35:54,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-06-14 15:35:54,999 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-14 15:35:54,999 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 118 flow [2024-06-14 15:35:55,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:55,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:55,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:55,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:35:55,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:35:55,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash 234560243, now seen corresponding path program 1 times [2024-06-14 15:35:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:55,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306737006] [2024-06-14 15:35:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:58,913 INFO 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:35:58,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:58,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306737006] [2024-06-14 15:35:58,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306737006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:58,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:58,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:35:58,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212903888] [2024-06-14 15:35:58,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:58,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:35:58,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:58,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:35:58,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:35:58,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:35:58,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:35:58,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:58,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:35:58,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:59,143 INFO L124 PetriNetUnfolderBase]: 147/295 cut-off events. [2024-06-14 15:35:59,143 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-14 15:35:59,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 295 events. 147/295 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1064 event pairs, 53 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 804. Up to 259 conditions per place. [2024-06-14 15:35:59,146 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-14 15:35:59,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 200 flow [2024-06-14 15:35:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:35:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:35:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-06-14 15:35:59,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:35:59,147 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 118 flow. Second operand 5 states and 64 transitions. [2024-06-14 15:35:59,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 200 flow [2024-06-14 15:35:59,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 180 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:35:59,152 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2024-06-14 15:35:59,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-06-14 15:35:59,157 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-14 15:35:59,157 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2024-06-14 15:35:59,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:35:59,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:59,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:59,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:35:59,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:35:59,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1318565773, now seen corresponding path program 1 times [2024-06-14 15:35:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615513425] [2024-06-14 15:35:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:03,130 INFO 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:36:03,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615513425] [2024-06-14 15:36:03,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615513425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:03,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:03,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:36:03,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401339795] [2024-06-14 15:36:03,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:03,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:36:03,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:36:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:36:03,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:03,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:03,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:03,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:03,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:03,490 INFO L124 PetriNetUnfolderBase]: 203/365 cut-off events. [2024-06-14 15:36:03,490 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2024-06-14 15:36:03,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 365 events. 203/365 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1252 event pairs, 70 based on Foata normal form. 2/365 useless extension candidates. Maximal degree in co-relation 1085. Up to 327 conditions per place. [2024-06-14 15:36:03,493 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2024-06-14 15:36:03,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 275 flow [2024-06-14 15:36:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 15:36:03,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2024-06-14 15:36:03,495 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 7 states and 79 transitions. [2024-06-14 15:36:03,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 275 flow [2024-06-14 15:36:03,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:36:03,497 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 184 flow [2024-06-14 15:36:03,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-06-14 15:36:03,499 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 15:36:03,499 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 184 flow [2024-06-14 15:36:03,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:03,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:03,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:03,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:36:03,500 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:03,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1625823128, now seen corresponding path program 1 times [2024-06-14 15:36:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078726469] [2024-06-14 15:36:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:07,274 INFO 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:36:07,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:07,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078726469] [2024-06-14 15:36:07,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078726469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:07,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:07,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:36:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241068705] [2024-06-14 15:36:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:07,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:36:07,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:07,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:36:07,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:36:07,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:07,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:07,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:07,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:07,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:07,598 INFO L124 PetriNetUnfolderBase]: 206/370 cut-off events. [2024-06-14 15:36:07,598 INFO L125 PetriNetUnfolderBase]: For 996/996 co-relation queries the response was YES. [2024-06-14 15:36:07,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 370 events. 206/370 cut-off events. For 996/996 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1264 event pairs, 74 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1252. Up to 349 conditions per place. [2024-06-14 15:36:07,601 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-14 15:36:07,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 313 flow [2024-06-14 15:36:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:36:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:36:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-06-14 15:36:07,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-06-14 15:36:07,603 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 184 flow. Second operand 6 states and 67 transitions. [2024-06-14 15:36:07,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 313 flow [2024-06-14 15:36:07,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 299 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 15:36:07,606 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 210 flow [2024-06-14 15:36:07,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-14 15:36:07,607 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-14 15:36:07,607 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 210 flow [2024-06-14 15:36:07,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:07,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:07,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:07,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:36:07,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:07,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2074127378, now seen corresponding path program 2 times [2024-06-14 15:36:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305774840] [2024-06-14 15:36:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305774840] [2024-06-14 15:36:11,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305774840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:11,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:11,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:36:11,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247109742] [2024-06-14 15:36:11,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:11,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:36:11,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:11,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:36:11,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:36:11,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:11,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:11,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:11,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:11,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:12,097 INFO L124 PetriNetUnfolderBase]: 201/362 cut-off events. [2024-06-14 15:36:12,098 INFO L125 PetriNetUnfolderBase]: For 1265/1265 co-relation queries the response was YES. [2024-06-14 15:36:12,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 362 events. 201/362 cut-off events. For 1265/1265 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1239 event pairs, 74 based on Foata normal form. 2/362 useless extension candidates. Maximal degree in co-relation 1263. Up to 324 conditions per place. [2024-06-14 15:36:12,101 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2024-06-14 15:36:12,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 328 flow [2024-06-14 15:36:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-14 15:36:12,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2024-06-14 15:36:12,103 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 210 flow. Second operand 7 states and 78 transitions. [2024-06-14 15:36:12,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 328 flow [2024-06-14 15:36:12,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 309 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:36:12,105 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 226 flow [2024-06-14 15:36:12,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-06-14 15:36:12,107 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-14 15:36:12,108 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 226 flow [2024-06-14 15:36:12,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:12,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:12,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:12,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:36:12,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:12,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2074135314, now seen corresponding path program 1 times [2024-06-14 15:36:12,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:12,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16214847] [2024-06-14 15:36:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:16,049 INFO 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:36:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16214847] [2024-06-14 15:36:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16214847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:16,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:16,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141508488] [2024-06-14 15:36:16,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:16,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:16,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:16,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:16,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:16,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:36:16,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:16,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:16,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:16,363 INFO L124 PetriNetUnfolderBase]: 202/364 cut-off events. [2024-06-14 15:36:16,364 INFO L125 PetriNetUnfolderBase]: For 1528/1528 co-relation queries the response was YES. [2024-06-14 15:36:16,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 364 events. 202/364 cut-off events. For 1528/1528 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1231 event pairs, 72 based on Foata normal form. 2/364 useless extension candidates. Maximal degree in co-relation 1316. Up to 314 conditions per place. [2024-06-14 15:36:16,368 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 35 selfloop transitions, 19 changer transitions 0/56 dead transitions. [2024-06-14 15:36:16,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 402 flow [2024-06-14 15:36:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:36:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:36:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 15:36:16,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-14 15:36:16,370 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 226 flow. Second operand 8 states and 89 transitions. [2024-06-14 15:36:16,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 402 flow [2024-06-14 15:36:16,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 364 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:36:16,376 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 262 flow [2024-06-14 15:36:16,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=262, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-06-14 15:36:16,377 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-14 15:36:16,377 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 262 flow [2024-06-14 15:36:16,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:36:16,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:16,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:16,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:36:16,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:16,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -132993362, now seen corresponding path program 1 times [2024-06-14 15:36:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:16,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681540835] [2024-06-14 15:36:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:20,298 INFO 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:36:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681540835] [2024-06-14 15:36:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681540835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002001941] [2024-06-14 15:36:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:20,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:20,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:20,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:20,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:20,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:36:20,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:20,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:20,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:20,618 INFO L124 PetriNetUnfolderBase]: 208/374 cut-off events. [2024-06-14 15:36:20,618 INFO L125 PetriNetUnfolderBase]: For 1936/1936 co-relation queries the response was YES. [2024-06-14 15:36:20,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 374 events. 208/374 cut-off events. For 1936/1936 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1300 event pairs, 50 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 1431. Up to 332 conditions per place. [2024-06-14 15:36:20,620 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 48 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2024-06-14 15:36:20,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 432 flow [2024-06-14 15:36:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-14 15:36:20,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-14 15:36:20,622 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 262 flow. Second operand 7 states and 80 transitions. [2024-06-14 15:36:20,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 432 flow [2024-06-14 15:36:20,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 408 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:36:20,624 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 292 flow [2024-06-14 15:36:20,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-06-14 15:36:20,625 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2024-06-14 15:36:20,625 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 292 flow [2024-06-14 15:36:20,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:36:20,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:20,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:20,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:36:20,626 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:20,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -303691142, now seen corresponding path program 2 times [2024-06-14 15:36:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:20,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718282825] [2024-06-14 15:36:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:20,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718282825] [2024-06-14 15:36:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718282825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:24,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144400307] [2024-06-14 15:36:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:24,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:24,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:24,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:24,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 292 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:36:24,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:24,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:24,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:24,774 INFO L124 PetriNetUnfolderBase]: 219/392 cut-off events. [2024-06-14 15:36:24,780 INFO L125 PetriNetUnfolderBase]: For 2440/2440 co-relation queries the response was YES. [2024-06-14 15:36:24,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 392 events. 219/392 cut-off events. For 2440/2440 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1378 event pairs, 50 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 1629. Up to 337 conditions per place. [2024-06-14 15:36:24,783 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 47 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-14 15:36:24,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 500 flow [2024-06-14 15:36:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-14 15:36:24,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2024-06-14 15:36:24,785 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 292 flow. Second operand 7 states and 81 transitions. [2024-06-14 15:36:24,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 500 flow [2024-06-14 15:36:24,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 482 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 15:36:24,788 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 343 flow [2024-06-14 15:36:24,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-06-14 15:36:24,788 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-14 15:36:24,788 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 343 flow [2024-06-14 15:36:24,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:36:24,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:24,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:24,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:36:24,789 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:24,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash -299049512, now seen corresponding path program 3 times [2024-06-14 15:36:24,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266974840] [2024-06-14 15:36:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266974840] [2024-06-14 15:36:28,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266974840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:28,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903355] [2024-06-14 15:36:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:28,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:28,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:28,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:28,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 343 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:36:28,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:28,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:28,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:29,200 INFO L124 PetriNetUnfolderBase]: 221/396 cut-off events. [2024-06-14 15:36:29,200 INFO L125 PetriNetUnfolderBase]: For 2980/2980 co-relation queries the response was YES. [2024-06-14 15:36:29,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 396 events. 221/396 cut-off events. For 2980/2980 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1391 event pairs, 48 based on Foata normal form. 4/398 useless extension candidates. Maximal degree in co-relation 1705. Up to 288 conditions per place. [2024-06-14 15:36:29,203 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 47 selfloop transitions, 22 changer transitions 0/71 dead transitions. [2024-06-14 15:36:29,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 573 flow [2024-06-14 15:36:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:36:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:36:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 15:36:29,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-14 15:36:29,204 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 343 flow. Second operand 8 states and 93 transitions. [2024-06-14 15:36:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 573 flow [2024-06-14 15:36:29,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 553 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:36:29,208 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 413 flow [2024-06-14 15:36:29,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=413, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-06-14 15:36:29,209 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-14 15:36:29,209 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 413 flow [2024-06-14 15:36:29,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:36:29,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:29,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:29,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:36:29,210 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:29,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash -126313358, now seen corresponding path program 1 times [2024-06-14 15:36:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:29,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307921720] [2024-06-14 15:36:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:33,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:33,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307921720] [2024-06-14 15:36:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307921720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:33,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:33,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008407173] [2024-06-14 15:36:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:33,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:33,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:33,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 413 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:33,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:33,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:33,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:33,540 INFO L124 PetriNetUnfolderBase]: 222/398 cut-off events. [2024-06-14 15:36:33,541 INFO L125 PetriNetUnfolderBase]: For 3308/3308 co-relation queries the response was YES. [2024-06-14 15:36:33,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 398 events. 222/398 cut-off events. For 3308/3308 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1414 event pairs, 49 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 1815. Up to 335 conditions per place. [2024-06-14 15:36:33,543 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 50 selfloop transitions, 23 changer transitions 0/75 dead transitions. [2024-06-14 15:36:33,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 643 flow [2024-06-14 15:36:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:36:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:36:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:36:33,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:36:33,545 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 413 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:36:33,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 643 flow [2024-06-14 15:36:33,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 612 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:36:33,550 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 470 flow [2024-06-14 15:36:33,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-06-14 15:36:33,551 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-14 15:36:33,551 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 470 flow [2024-06-14 15:36:33,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:33,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:33,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:33,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:36:33,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:33,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:33,552 INFO L85 PathProgramCache]: Analyzing trace with hash -158297167, now seen corresponding path program 1 times [2024-06-14 15:36:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:33,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566220396] [2024-06-14 15:36:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:33,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:37,774 INFO 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:36:37,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:37,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566220396] [2024-06-14 15:36:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566220396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821659522] [2024-06-14 15:36:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:37,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:37,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:37,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:37,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:37,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:37,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:38,152 INFO L124 PetriNetUnfolderBase]: 220/395 cut-off events. [2024-06-14 15:36:38,153 INFO L125 PetriNetUnfolderBase]: For 3509/3509 co-relation queries the response was YES. [2024-06-14 15:36:38,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 395 events. 220/395 cut-off events. For 3509/3509 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1383 event pairs, 47 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 1879. Up to 350 conditions per place. [2024-06-14 15:36:38,155 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 61 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2024-06-14 15:36:38,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 654 flow [2024-06-14 15:36:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-14 15:36:38,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-14 15:36:38,156 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 470 flow. Second operand 7 states and 80 transitions. [2024-06-14 15:36:38,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 654 flow [2024-06-14 15:36:38,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 618 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 15:36:38,160 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 468 flow [2024-06-14 15:36:38,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=468, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2024-06-14 15:36:38,161 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-14 15:36:38,161 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 468 flow [2024-06-14 15:36:38,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:38,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:38,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:38,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:36:38,162 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:38,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash -828208594, now seen corresponding path program 1 times [2024-06-14 15:36:38,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:38,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493467897] [2024-06-14 15:36:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:42,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:42,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493467897] [2024-06-14 15:36:42,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493467897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:42,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:42,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:42,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5266836] [2024-06-14 15:36:42,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:42,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:42,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:42,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:42,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:42,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:42,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 468 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:42,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:42,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:42,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:42,425 INFO L124 PetriNetUnfolderBase]: 226/405 cut-off events. [2024-06-14 15:36:42,425 INFO L125 PetriNetUnfolderBase]: For 4113/4113 co-relation queries the response was YES. [2024-06-14 15:36:42,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 405 events. 226/405 cut-off events. For 4113/4113 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1430 event pairs, 46 based on Foata normal form. 2/405 useless extension candidates. Maximal degree in co-relation 1961. Up to 355 conditions per place. [2024-06-14 15:36:42,428 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-06-14 15:36:42,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 682 flow [2024-06-14 15:36:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:36:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:36:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 15:36:42,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-14 15:36:42,431 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 468 flow. Second operand 8 states and 89 transitions. [2024-06-14 15:36:42,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 682 flow [2024-06-14 15:36:42,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 651 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 15:36:42,444 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 490 flow [2024-06-14 15:36:42,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=490, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-14 15:36:42,445 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-14 15:36:42,446 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 490 flow [2024-06-14 15:36:42,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:42,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:42,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:42,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:36:42,446 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:42,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash -824483944, now seen corresponding path program 2 times [2024-06-14 15:36:42,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:42,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405030963] [2024-06-14 15:36:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:42,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:46,620 INFO 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:36:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:46,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405030963] [2024-06-14 15:36:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405030963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:46,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:46,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560680174] [2024-06-14 15:36:46,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:46,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:46,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:46,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:46,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:46,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 490 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:46,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:46,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:46,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:46,932 INFO L124 PetriNetUnfolderBase]: 232/415 cut-off events. [2024-06-14 15:36:46,933 INFO L125 PetriNetUnfolderBase]: For 4699/4699 co-relation queries the response was YES. [2024-06-14 15:36:46,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 415 events. 232/415 cut-off events. For 4699/4699 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1473 event pairs, 41 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2057. Up to 301 conditions per place. [2024-06-14 15:36:46,935 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 49 selfloop transitions, 30 changer transitions 0/81 dead transitions. [2024-06-14 15:36:46,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 738 flow [2024-06-14 15:36:46,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:36:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:36:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 15:36:46,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:36:46,937 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 490 flow. Second operand 8 states and 94 transitions. [2024-06-14 15:36:46,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 738 flow [2024-06-14 15:36:46,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 705 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:36:46,942 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 542 flow [2024-06-14 15:36:46,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=542, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-06-14 15:36:46,942 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-14 15:36:46,942 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 542 flow [2024-06-14 15:36:46,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:46,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:46,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:46,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:36:46,943 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:46,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash -154487732, now seen corresponding path program 3 times [2024-06-14 15:36:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894583976] [2024-06-14 15:36:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:50,945 INFO 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:36:50,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894583976] [2024-06-14 15:36:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894583976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:50,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:50,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:50,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80165534] [2024-06-14 15:36:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:50,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:51,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:51,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 542 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:51,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:51,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:51,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:51,280 INFO L124 PetriNetUnfolderBase]: 233/417 cut-off events. [2024-06-14 15:36:51,280 INFO L125 PetriNetUnfolderBase]: For 5209/5209 co-relation queries the response was YES. [2024-06-14 15:36:51,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 417 events. 233/417 cut-off events. For 5209/5209 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1497 event pairs, 47 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 2137. Up to 304 conditions per place. [2024-06-14 15:36:51,283 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 53 selfloop transitions, 28 changer transitions 0/83 dead transitions. [2024-06-14 15:36:51,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 800 flow [2024-06-14 15:36:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:36:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:36:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 15:36:51,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-14 15:36:51,286 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 542 flow. Second operand 8 states and 93 transitions. [2024-06-14 15:36:51,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 800 flow [2024-06-14 15:36:51,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 719 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:36:51,291 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 547 flow [2024-06-14 15:36:51,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=547, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-06-14 15:36:51,292 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-14 15:36:51,292 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 547 flow [2024-06-14 15:36:51,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:51,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:51,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:51,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:36:51,293 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:51,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:51,293 INFO L85 PathProgramCache]: Analyzing trace with hash 371835347, now seen corresponding path program 1 times [2024-06-14 15:36:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:51,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806153426] [2024-06-14 15:36:51,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:51,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:55,526 INFO 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:36:55,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806153426] [2024-06-14 15:36:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806153426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:55,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:55,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:55,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44529424] [2024-06-14 15:36:55,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:55,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:55,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:55,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:36:55,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 547 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:55,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:55,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:36:55,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:55,949 INFO L124 PetriNetUnfolderBase]: 236/422 cut-off events. [2024-06-14 15:36:55,949 INFO L125 PetriNetUnfolderBase]: For 5605/5605 co-relation queries the response was YES. [2024-06-14 15:36:55,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 422 events. 236/422 cut-off events. For 5605/5605 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1511 event pairs, 50 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 2175. Up to 371 conditions per place. [2024-06-14 15:36:55,953 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-14 15:36:55,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 787 flow [2024-06-14 15:36:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:36:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:36:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 15:36:55,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 15:36:55,956 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 547 flow. Second operand 9 states and 97 transitions. [2024-06-14 15:36:55,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 787 flow [2024-06-14 15:36:55,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 740 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 15:36:55,967 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 561 flow [2024-06-14 15:36:55,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=561, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-06-14 15:36:55,968 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-14 15:36:55,968 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 561 flow [2024-06-14 15:36:55,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:55,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:55,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:36:55,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:36:55,970 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:36:55,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 378977747, now seen corresponding path program 2 times [2024-06-14 15:36:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125226007] [2024-06-14 15:36:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:00,028 INFO 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:37:00,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:00,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125226007] [2024-06-14 15:37:00,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125226007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:00,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:00,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:37:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758972899] [2024-06-14 15:37:00,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:00,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:37:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:37:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:37:00,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:00,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 561 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:00,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:00,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:00,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:00,384 INFO L124 PetriNetUnfolderBase]: 234/419 cut-off events. [2024-06-14 15:37:00,400 INFO L125 PetriNetUnfolderBase]: For 6026/6026 co-relation queries the response was YES. [2024-06-14 15:37:00,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 419 events. 234/419 cut-off events. For 6026/6026 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1498 event pairs, 50 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 2157. Up to 369 conditions per place. [2024-06-14 15:37:00,403 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 59 selfloop transitions, 20 changer transitions 0/81 dead transitions. [2024-06-14 15:37:00,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 745 flow [2024-06-14 15:37:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 15:37:00,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:37:00,404 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 561 flow. Second operand 8 states and 88 transitions. [2024-06-14 15:37:00,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 745 flow [2024-06-14 15:37:00,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 697 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:37:00,412 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 558 flow [2024-06-14 15:37:00,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-06-14 15:37:00,412 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-14 15:37:00,412 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 558 flow [2024-06-14 15:37:00,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:00,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:00,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:00,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:37:00,413 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:00,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash 379254577, now seen corresponding path program 1 times [2024-06-14 15:37:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490680124] [2024-06-14 15:37:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:04,896 INFO 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:37:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490680124] [2024-06-14 15:37:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490680124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:04,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:04,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:04,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374956584] [2024-06-14 15:37:04,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:04,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:04,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:04,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:04,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:04,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 558 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:04,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:04,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:04,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:05,324 INFO L124 PetriNetUnfolderBase]: 263/467 cut-off events. [2024-06-14 15:37:05,324 INFO L125 PetriNetUnfolderBase]: For 7748/7748 co-relation queries the response was YES. [2024-06-14 15:37:05,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 467 events. 263/467 cut-off events. For 7748/7748 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1737 event pairs, 46 based on Foata normal form. 4/469 useless extension candidates. Maximal degree in co-relation 2396. Up to 241 conditions per place. [2024-06-14 15:37:05,328 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 57 selfloop transitions, 44 changer transitions 0/103 dead transitions. [2024-06-14 15:37:05,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 103 transitions, 1050 flow [2024-06-14 15:37:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:37:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:37:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:37:05,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:37:05,341 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 558 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:37:05,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 103 transitions, 1050 flow [2024-06-14 15:37:05,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 103 transitions, 1001 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:37:05,349 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 702 flow [2024-06-14 15:37:05,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=702, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2024-06-14 15:37:05,350 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-14 15:37:05,350 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 702 flow [2024-06-14 15:37:05,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:05,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:05,350 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:37:05,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:37:05,351 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:05,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:05,351 INFO L85 PathProgramCache]: Analyzing trace with hash 92476759, now seen corresponding path program 1 times [2024-06-14 15:37:05,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:05,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430110798] [2024-06-14 15:37:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:09,567 INFO 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:37:09,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430110798] [2024-06-14 15:37:09,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430110798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:09,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:09,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:09,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682435638] [2024-06-14 15:37:09,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:09,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:09,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:09,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:09,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:09,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 702 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:09,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:09,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:09,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:10,031 INFO L124 PetriNetUnfolderBase]: 267/475 cut-off events. [2024-06-14 15:37:10,031 INFO L125 PetriNetUnfolderBase]: For 8248/8248 co-relation queries the response was YES. [2024-06-14 15:37:10,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2688 conditions, 475 events. 267/475 cut-off events. For 8248/8248 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1780 event pairs, 34 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 2644. Up to 413 conditions per place. [2024-06-14 15:37:10,035 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 84 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2024-06-14 15:37:10,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 942 flow [2024-06-14 15:37:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-14 15:37:10,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2024-06-14 15:37:10,037 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 702 flow. Second operand 8 states and 86 transitions. [2024-06-14 15:37:10,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 942 flow [2024-06-14 15:37:10,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 97 transitions, 881 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 15:37:10,047 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 681 flow [2024-06-14 15:37:10,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=681, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-06-14 15:37:10,048 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-14 15:37:10,048 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 681 flow [2024-06-14 15:37:10,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:10,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:10,048 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:37:10,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:37:10,048 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:10,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash 92537333, now seen corresponding path program 1 times [2024-06-14 15:37:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:10,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487329488] [2024-06-14 15:37:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487329488] [2024-06-14 15:37:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487329488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:14,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:14,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345949161] [2024-06-14 15:37:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:14,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:14,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:14,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:14,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:14,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 681 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:14,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:14,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:14,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:14,469 INFO L124 PetriNetUnfolderBase]: 265/472 cut-off events. [2024-06-14 15:37:14,469 INFO L125 PetriNetUnfolderBase]: For 8413/8413 co-relation queries the response was YES. [2024-06-14 15:37:14,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 472 events. 265/472 cut-off events. For 8413/8413 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1771 event pairs, 46 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 2617. Up to 416 conditions per place. [2024-06-14 15:37:14,473 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 78 selfloop transitions, 17 changer transitions 0/97 dead transitions. [2024-06-14 15:37:14,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 913 flow [2024-06-14 15:37:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 15:37:14,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-14 15:37:14,475 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 681 flow. Second operand 8 states and 89 transitions. [2024-06-14 15:37:14,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 913 flow [2024-06-14 15:37:14,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 879 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:14,486 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 689 flow [2024-06-14 15:37:14,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=689, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-06-14 15:37:14,487 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-14 15:37:14,487 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 689 flow [2024-06-14 15:37:14,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:14,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:14,487 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:37:14,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:37:14,488 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:14,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash 92537209, now seen corresponding path program 2 times [2024-06-14 15:37:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256881534] [2024-06-14 15:37:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:18,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:18,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256881534] [2024-06-14 15:37:18,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256881534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:18,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:18,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670376289] [2024-06-14 15:37:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:18,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:18,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:18,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:19,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:19,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 689 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:19,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:19,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:19,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:19,341 INFO L124 PetriNetUnfolderBase]: 269/480 cut-off events. [2024-06-14 15:37:19,341 INFO L125 PetriNetUnfolderBase]: For 9565/9565 co-relation queries the response was YES. [2024-06-14 15:37:19,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 480 events. 269/480 cut-off events. For 9565/9565 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1811 event pairs, 46 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2693. Up to 427 conditions per place. [2024-06-14 15:37:19,345 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 82 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-06-14 15:37:19,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 98 transitions, 935 flow [2024-06-14 15:37:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 15:37:19,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:37:19,348 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 689 flow. Second operand 8 states and 88 transitions. [2024-06-14 15:37:19,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 98 transitions, 935 flow [2024-06-14 15:37:19,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 872 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:37:19,360 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 675 flow [2024-06-14 15:37:19,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=675, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2024-06-14 15:37:19,361 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-14 15:37:19,361 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 675 flow [2024-06-14 15:37:19,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:19,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:19,362 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:37:19,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:37:19,362 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:19,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash 95338679, now seen corresponding path program 1 times [2024-06-14 15:37:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413825837] [2024-06-14 15:37:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:23,344 INFO 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:37:23,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:23,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413825837] [2024-06-14 15:37:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413825837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:23,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018786629] [2024-06-14 15:37:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:23,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:23,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:23,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 675 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:23,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:23,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:23,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:23,721 INFO L124 PetriNetUnfolderBase]: 275/490 cut-off events. [2024-06-14 15:37:23,721 INFO L125 PetriNetUnfolderBase]: For 9625/9625 co-relation queries the response was YES. [2024-06-14 15:37:23,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 490 events. 275/490 cut-off events. For 9625/9625 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1854 event pairs, 50 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2715. Up to 432 conditions per place. [2024-06-14 15:37:23,725 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 84 selfloop transitions, 16 changer transitions 0/102 dead transitions. [2024-06-14 15:37:23,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 102 transitions, 939 flow [2024-06-14 15:37:23,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:37:23,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-14 15:37:23,727 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 675 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:37:23,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 102 transitions, 939 flow [2024-06-14 15:37:23,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 102 transitions, 902 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:23,738 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 695 flow [2024-06-14 15:37:23,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=695, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-06-14 15:37:23,739 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-14 15:37:23,739 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 695 flow [2024-06-14 15:37:23,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:23,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:23,739 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:37:23,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:37:23,740 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:23,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash 210809339, now seen corresponding path program 2 times [2024-06-14 15:37:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:23,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776838291] [2024-06-14 15:37:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:27,705 INFO 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:37:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776838291] [2024-06-14 15:37:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776838291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:27,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686467126] [2024-06-14 15:37:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:27,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:27,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:27,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 695 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:27,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:27,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:27,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:28,069 INFO L124 PetriNetUnfolderBase]: 281/500 cut-off events. [2024-06-14 15:37:28,069 INFO L125 PetriNetUnfolderBase]: For 10363/10363 co-relation queries the response was YES. [2024-06-14 15:37:28,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 500 events. 281/500 cut-off events. For 10363/10363 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1913 event pairs, 42 based on Foata normal form. 2/500 useless extension candidates. Maximal degree in co-relation 2801. Up to 330 conditions per place. [2024-06-14 15:37:28,072 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 42 changer transitions 0/106 dead transitions. [2024-06-14 15:37:28,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 106 transitions, 1081 flow [2024-06-14 15:37:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 15:37:28,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-14 15:37:28,074 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 695 flow. Second operand 9 states and 107 transitions. [2024-06-14 15:37:28,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 106 transitions, 1081 flow [2024-06-14 15:37:28,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 106 transitions, 1046 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:37:28,085 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 812 flow [2024-06-14 15:37:28,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2024-06-14 15:37:28,086 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 70 predicate places. [2024-06-14 15:37:28,086 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 812 flow [2024-06-14 15:37:28,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:28,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:28,086 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:37:28,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:37:28,086 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:28,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 210624889, now seen corresponding path program 3 times [2024-06-14 15:37:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:28,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932402171] [2024-06-14 15:37:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:32,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932402171] [2024-06-14 15:37:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932402171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:32,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254368149] [2024-06-14 15:37:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:32,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:32,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:32,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:32,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:32,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 812 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:32,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:32,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:32,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:33,075 INFO L124 PetriNetUnfolderBase]: 285/508 cut-off events. [2024-06-14 15:37:33,075 INFO L125 PetriNetUnfolderBase]: For 11491/11491 co-relation queries the response was YES. [2024-06-14 15:37:33,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 508 events. 285/508 cut-off events. For 11491/11491 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1944 event pairs, 48 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 3005. Up to 448 conditions per place. [2024-06-14 15:37:33,086 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 84 selfloop transitions, 17 changer transitions 0/103 dead transitions. [2024-06-14 15:37:33,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 103 transitions, 1066 flow [2024-06-14 15:37:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 15:37:33,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:37:33,088 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 812 flow. Second operand 8 states and 88 transitions. [2024-06-14 15:37:33,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 103 transitions, 1066 flow [2024-06-14 15:37:33,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 103 transitions, 993 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:33,101 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 795 flow [2024-06-14 15:37:33,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=795, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-06-14 15:37:33,102 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-14 15:37:33,102 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 795 flow [2024-06-14 15:37:33,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:33,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:33,102 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:37:33,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:37:33,103 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:33,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 210629849, now seen corresponding path program 3 times [2024-06-14 15:37:33,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:33,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378715103] [2024-06-14 15:37:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:33,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:37,147 INFO 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:37:37,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:37,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378715103] [2024-06-14 15:37:37,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378715103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:37,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:37,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:37,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375040167] [2024-06-14 15:37:37,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:37,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:37,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:37,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:37,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:37,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:37,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 795 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:37,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:37,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:37,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:37,501 INFO L124 PetriNetUnfolderBase]: 296/526 cut-off events. [2024-06-14 15:37:37,501 INFO L125 PetriNetUnfolderBase]: For 12748/12748 co-relation queries the response was YES. [2024-06-14 15:37:37,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 526 events. 296/526 cut-off events. For 12748/12748 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2043 event pairs, 47 based on Foata normal form. 2/526 useless extension candidates. Maximal degree in co-relation 3083. Up to 350 conditions per place. [2024-06-14 15:37:37,505 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 40 changer transitions 0/111 dead transitions. [2024-06-14 15:37:37,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 1201 flow [2024-06-14 15:37:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:37:37,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:37:37,506 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 795 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:37:37,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 1201 flow [2024-06-14 15:37:37,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 1155 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:37,520 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 874 flow [2024-06-14 15:37:37,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=874, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2024-06-14 15:37:37,521 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2024-06-14 15:37:37,521 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 874 flow [2024-06-14 15:37:37,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:37,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:37,521 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:37:37,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:37:37,522 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:37,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash 210802829, now seen corresponding path program 4 times [2024-06-14 15:37:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:37,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168363782] [2024-06-14 15:37:37,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:37,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:41,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168363782] [2024-06-14 15:37:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168363782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907634359] [2024-06-14 15:37:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:41,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:41,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:41,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:41,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:41,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 874 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:41,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:41,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:41,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:41,972 INFO L124 PetriNetUnfolderBase]: 292/520 cut-off events. [2024-06-14 15:37:41,973 INFO L125 PetriNetUnfolderBase]: For 13016/13016 co-relation queries the response was YES. [2024-06-14 15:37:41,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3140 conditions, 520 events. 292/520 cut-off events. For 13016/13016 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2019 event pairs, 40 based on Foata normal form. 2/520 useless extension candidates. Maximal degree in co-relation 3087. Up to 347 conditions per place. [2024-06-14 15:37:41,976 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 43 changer transitions 0/111 dead transitions. [2024-06-14 15:37:41,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 111 transitions, 1244 flow [2024-06-14 15:37:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 15:37:41,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-14 15:37:41,978 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 874 flow. Second operand 9 states and 107 transitions. [2024-06-14 15:37:41,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 111 transitions, 1244 flow [2024-06-14 15:37:41,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 1191 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:37:41,995 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 912 flow [2024-06-14 15:37:41,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2024-06-14 15:37:41,995 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-14 15:37:41,996 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 912 flow [2024-06-14 15:37:41,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:41,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:41,996 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:37:41,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:37:41,996 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:41,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1364676231, now seen corresponding path program 4 times [2024-06-14 15:37:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:41,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115825600] [2024-06-14 15:37:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115825600] [2024-06-14 15:37:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115825600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:46,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:46,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:46,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329554072] [2024-06-14 15:37:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:46,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:46,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:46,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 912 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:46,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:46,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:46,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:46,878 INFO L124 PetriNetUnfolderBase]: 293/523 cut-off events. [2024-06-14 15:37:46,879 INFO L125 PetriNetUnfolderBase]: For 14164/14164 co-relation queries the response was YES. [2024-06-14 15:37:46,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 523 events. 293/523 cut-off events. For 14164/14164 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2037 event pairs, 49 based on Foata normal form. 4/525 useless extension candidates. Maximal degree in co-relation 3078. Up to 399 conditions per place. [2024-06-14 15:37:46,882 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 77 selfloop transitions, 30 changer transitions 0/109 dead transitions. [2024-06-14 15:37:46,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1170 flow [2024-06-14 15:37:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 15:37:46,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-14 15:37:46,883 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 912 flow. Second operand 9 states and 101 transitions. [2024-06-14 15:37:46,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1170 flow [2024-06-14 15:37:46,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 1100 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:46,900 INFO L231 Difference]: Finished difference. Result has 113 places, 94 transitions, 915 flow [2024-06-14 15:37:46,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=915, PETRI_PLACES=113, PETRI_TRANSITIONS=94} [2024-06-14 15:37:46,901 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-14 15:37:46,902 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 94 transitions, 915 flow [2024-06-14 15:37:46,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:46,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:46,902 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:37:46,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:37:46,902 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:46,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1128316421, now seen corresponding path program 5 times [2024-06-14 15:37:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445861955] [2024-06-14 15:37:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:51,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445861955] [2024-06-14 15:37:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445861955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171290074] [2024-06-14 15:37:51,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:51,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:51,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:51,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:51,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 94 transitions, 915 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:51,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:51,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:51,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:51,622 INFO L124 PetriNetUnfolderBase]: 299/533 cut-off events. [2024-06-14 15:37:51,623 INFO L125 PetriNetUnfolderBase]: For 14290/14290 co-relation queries the response was YES. [2024-06-14 15:37:51,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 533 events. 299/533 cut-off events. For 14290/14290 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2096 event pairs, 41 based on Foata normal form. 2/533 useless extension candidates. Maximal degree in co-relation 3142. Up to 356 conditions per place. [2024-06-14 15:37:51,626 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 65 selfloop transitions, 48 changer transitions 0/115 dead transitions. [2024-06-14 15:37:51,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 115 transitions, 1323 flow [2024-06-14 15:37:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:37:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:37:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:37:51,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:37:51,628 INFO L175 Difference]: Start difference. First operand has 113 places, 94 transitions, 915 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:37:51,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 115 transitions, 1323 flow [2024-06-14 15:37:51,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 1237 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:37:51,646 INFO L231 Difference]: Finished difference. Result has 115 places, 96 transitions, 950 flow [2024-06-14 15:37:51,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=950, PETRI_PLACES=115, PETRI_TRANSITIONS=96} [2024-06-14 15:37:51,647 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-14 15:37:51,647 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 96 transitions, 950 flow [2024-06-14 15:37:51,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:51,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:51,648 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:37:51,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:37:51,648 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:51,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1128316173, now seen corresponding path program 1 times [2024-06-14 15:37:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:51,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263759025] [2024-06-14 15:37:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:51,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:55,846 INFO 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:37:55,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:55,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263759025] [2024-06-14 15:37:55,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263759025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:55,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:55,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735794038] [2024-06-14 15:37:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:55,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:55,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:37:55,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 96 transitions, 950 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:55,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:55,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:37:55,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:56,248 INFO L124 PetriNetUnfolderBase]: 307/546 cut-off events. [2024-06-14 15:37:56,248 INFO L125 PetriNetUnfolderBase]: For 15130/15130 co-relation queries the response was YES. [2024-06-14 15:37:56,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 546 events. 307/546 cut-off events. For 15130/15130 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2153 event pairs, 54 based on Foata normal form. 1/545 useless extension candidates. Maximal degree in co-relation 3265. Up to 479 conditions per place. [2024-06-14 15:37:56,252 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 28 changer transitions 0/115 dead transitions. [2024-06-14 15:37:56,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 115 transitions, 1358 flow [2024-06-14 15:37:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:37:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:37:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:37:56,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:37:56,254 INFO L175 Difference]: Start difference. First operand has 115 places, 96 transitions, 950 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:37:56,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 115 transitions, 1358 flow [2024-06-14 15:37:56,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 1237 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:37:56,275 INFO L231 Difference]: Finished difference. Result has 116 places, 100 transitions, 922 flow [2024-06-14 15:37:56,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=922, PETRI_PLACES=116, PETRI_TRANSITIONS=100} [2024-06-14 15:37:56,276 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-14 15:37:56,276 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 100 transitions, 922 flow [2024-06-14 15:37:56,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:37:56,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:56,276 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:37:56,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:37:56,277 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:56,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:56,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1128019503, now seen corresponding path program 2 times [2024-06-14 15:37:56,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:56,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724100607] [2024-06-14 15:37:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:00,563 INFO 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:38:00,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:00,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724100607] [2024-06-14 15:38:00,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724100607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:00,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:00,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711748962] [2024-06-14 15:38:00,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:00,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:00,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:00,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:00,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:00,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:00,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 100 transitions, 922 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:38:00,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:00,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:00,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:00,996 INFO L124 PetriNetUnfolderBase]: 305/543 cut-off events. [2024-06-14 15:38:00,996 INFO L125 PetriNetUnfolderBase]: For 15389/15389 co-relation queries the response was YES. [2024-06-14 15:38:00,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3199 conditions, 543 events. 305/543 cut-off events. For 15389/15389 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2146 event pairs, 56 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 3144. Up to 477 conditions per place. [2024-06-14 15:38:01,000 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 84 selfloop transitions, 28 changer transitions 0/114 dead transitions. [2024-06-14 15:38:01,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 114 transitions, 1238 flow [2024-06-14 15:38:01,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:38:01,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:38:01,002 INFO L175 Difference]: Start difference. First operand has 116 places, 100 transitions, 922 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:38:01,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 114 transitions, 1238 flow [2024-06-14 15:38:01,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 1174 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:38:01,021 INFO L231 Difference]: Finished difference. Result has 119 places, 100 transitions, 919 flow [2024-06-14 15:38:01,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=919, PETRI_PLACES=119, PETRI_TRANSITIONS=100} [2024-06-14 15:38:01,022 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-14 15:38:01,023 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 100 transitions, 919 flow [2024-06-14 15:38:01,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 15:38:01,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:01,023 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:38:01,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:38:01,023 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:01,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1136597141, now seen corresponding path program 6 times [2024-06-14 15:38:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144639029] [2024-06-14 15:38:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:05,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:38:05,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:05,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144639029] [2024-06-14 15:38:05,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144639029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:05,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:05,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:38:05,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110146749] [2024-06-14 15:38:05,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:05,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:38:05,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:05,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:38:05,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:38:05,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:05,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 100 transitions, 919 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:05,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:05,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:05,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:05,542 INFO L124 PetriNetUnfolderBase]: 311/553 cut-off events. [2024-06-14 15:38:05,542 INFO L125 PetriNetUnfolderBase]: For 16875/16875 co-relation queries the response was YES. [2024-06-14 15:38:05,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 553 events. 311/553 cut-off events. For 16875/16875 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2199 event pairs, 49 based on Foata normal form. 2/553 useless extension candidates. Maximal degree in co-relation 3209. Up to 372 conditions per place. [2024-06-14 15:38:05,546 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 73 selfloop transitions, 44 changer transitions 0/119 dead transitions. [2024-06-14 15:38:05,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 1339 flow [2024-06-14 15:38:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:38:05,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:38:05,547 INFO L175 Difference]: Start difference. First operand has 119 places, 100 transitions, 919 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:38:05,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 1339 flow [2024-06-14 15:38:05,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 1278 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:38:05,572 INFO L231 Difference]: Finished difference. Result has 119 places, 102 transitions, 969 flow [2024-06-14 15:38:05,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=969, PETRI_PLACES=119, PETRI_TRANSITIONS=102} [2024-06-14 15:38:05,573 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-14 15:38:05,573 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 102 transitions, 969 flow [2024-06-14 15:38:05,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:05,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:05,573 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:38:05,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:38:05,573 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:05,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:05,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1136590383, now seen corresponding path program 3 times [2024-06-14 15:38:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:05,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777827300] [2024-06-14 15:38:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:05,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777827300] [2024-06-14 15:38:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777827300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:09,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:38:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113168534] [2024-06-14 15:38:09,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:09,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:38:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:09,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:38:09,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:38:09,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:09,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 102 transitions, 969 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:09,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:09,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:09,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:10,198 INFO L124 PetriNetUnfolderBase]: 309/550 cut-off events. [2024-06-14 15:38:10,198 INFO L125 PetriNetUnfolderBase]: For 17057/17057 co-relation queries the response was YES. [2024-06-14 15:38:10,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 550 events. 309/550 cut-off events. For 17057/17057 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2181 event pairs, 54 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 3249. Up to 485 conditions per place. [2024-06-14 15:38:10,202 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 27 changer transitions 0/114 dead transitions. [2024-06-14 15:38:10,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 114 transitions, 1221 flow [2024-06-14 15:38:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:38:10,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-14 15:38:10,203 INFO L175 Difference]: Start difference. First operand has 119 places, 102 transitions, 969 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:38:10,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 114 transitions, 1221 flow [2024-06-14 15:38:10,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 114 transitions, 1117 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:38:10,226 INFO L231 Difference]: Finished difference. Result has 121 places, 102 transitions, 924 flow [2024-06-14 15:38:10,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=924, PETRI_PLACES=121, PETRI_TRANSITIONS=102} [2024-06-14 15:38:10,226 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-14 15:38:10,227 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 102 transitions, 924 flow [2024-06-14 15:38:10,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:10,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:10,228 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:38:10,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:38:10,228 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:10,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1617259939, now seen corresponding path program 7 times [2024-06-14 15:38:10,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:10,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657508758] [2024-06-14 15:38:10,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:14,527 INFO 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:38:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657508758] [2024-06-14 15:38:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657508758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:14,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:14,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:38:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475795377] [2024-06-14 15:38:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:14,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:38:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:14,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:38:14,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:38:14,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:14,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 102 transitions, 924 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:14,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:14,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:14,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:14,901 INFO L124 PetriNetUnfolderBase]: 305/544 cut-off events. [2024-06-14 15:38:14,901 INFO L125 PetriNetUnfolderBase]: For 17224/17224 co-relation queries the response was YES. [2024-06-14 15:38:14,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3186 conditions, 544 events. 305/544 cut-off events. For 17224/17224 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2166 event pairs, 47 based on Foata normal form. 2/544 useless extension candidates. Maximal degree in co-relation 3128. Up to 366 conditions per place. [2024-06-14 15:38:14,925 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 74 selfloop transitions, 43 changer transitions 0/119 dead transitions. [2024-06-14 15:38:14,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 119 transitions, 1270 flow [2024-06-14 15:38:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:38:14,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:38:14,928 INFO L175 Difference]: Start difference. First operand has 121 places, 102 transitions, 924 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:38:14,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 119 transitions, 1270 flow [2024-06-14 15:38:14,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 119 transitions, 1200 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:38:14,952 INFO L231 Difference]: Finished difference. Result has 122 places, 102 transitions, 945 flow [2024-06-14 15:38:14,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=945, PETRI_PLACES=122, PETRI_TRANSITIONS=102} [2024-06-14 15:38:14,953 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-14 15:38:14,953 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 102 transitions, 945 flow [2024-06-14 15:38:14,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:14,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:14,954 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:38:14,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:38:14,954 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:14,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1128008591, now seen corresponding path program 1 times [2024-06-14 15:38:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009746483] [2024-06-14 15:38:14,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:14,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:19,687 INFO 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:38:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:19,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009746483] [2024-06-14 15:38:19,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009746483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:19,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:19,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:38:19,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206828073] [2024-06-14 15:38:19,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:19,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:38:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:19,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:38:19,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:38:19,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:19,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 102 transitions, 945 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:38:19,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:19,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:19,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:20,110 INFO L124 PetriNetUnfolderBase]: 306/547 cut-off events. [2024-06-14 15:38:20,111 INFO L125 PetriNetUnfolderBase]: For 18439/18439 co-relation queries the response was YES. [2024-06-14 15:38:20,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 547 events. 306/547 cut-off events. For 18439/18439 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2178 event pairs, 53 based on Foata normal form. 4/549 useless extension candidates. Maximal degree in co-relation 3148. Up to 464 conditions per place. [2024-06-14 15:38:20,115 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 84 selfloop transitions, 33 changer transitions 0/119 dead transitions. [2024-06-14 15:38:20,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 119 transitions, 1230 flow [2024-06-14 15:38:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:38:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:38:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 15:38:20,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-14 15:38:20,136 INFO L175 Difference]: Start difference. First operand has 122 places, 102 transitions, 945 flow. Second operand 11 states and 115 transitions. [2024-06-14 15:38:20,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 119 transitions, 1230 flow [2024-06-14 15:38:20,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 1114 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:38:20,161 INFO L231 Difference]: Finished difference. Result has 125 places, 104 transitions, 925 flow [2024-06-14 15:38:20,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=925, PETRI_PLACES=125, PETRI_TRANSITIONS=104} [2024-06-14 15:38:20,161 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-14 15:38:20,161 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 104 transitions, 925 flow [2024-06-14 15:38:20,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:38:20,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:20,162 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:38:20,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:38:20,162 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:20,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1428186481, now seen corresponding path program 1 times [2024-06-14 15:38:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:20,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55441741] [2024-06-14 15:38:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:20,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:24,309 INFO 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:38:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55441741] [2024-06-14 15:38:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55441741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:24,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:24,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237715106] [2024-06-14 15:38:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:24,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:24,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:24,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:24,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:24,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 104 transitions, 925 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:24,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:24,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:24,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:24,719 INFO L124 PetriNetUnfolderBase]: 310/555 cut-off events. [2024-06-14 15:38:24,720 INFO L125 PetriNetUnfolderBase]: For 17999/17999 co-relation queries the response was YES. [2024-06-14 15:38:24,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 555 events. 310/555 cut-off events. For 17999/17999 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2237 event pairs, 32 based on Foata normal form. 2/555 useless extension candidates. Maximal degree in co-relation 3185. Up to 485 conditions per place. [2024-06-14 15:38:24,723 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 109 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2024-06-14 15:38:24,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 123 transitions, 1217 flow [2024-06-14 15:38:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-14 15:38:24,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3263888888888889 [2024-06-14 15:38:24,741 INFO L175 Difference]: Start difference. First operand has 125 places, 104 transitions, 925 flow. Second operand 9 states and 94 transitions. [2024-06-14 15:38:24,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 123 transitions, 1217 flow [2024-06-14 15:38:24,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 1136 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:38:24,768 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 882 flow [2024-06-14 15:38:24,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=882, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2024-06-14 15:38:24,769 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-14 15:38:24,769 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 882 flow [2024-06-14 15:38:24,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:24,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:24,769 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:38:24,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:38:24,769 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:24,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1717141770, now seen corresponding path program 1 times [2024-06-14 15:38:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:24,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919391405] [2024-06-14 15:38:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:28,982 INFO 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:38:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919391405] [2024-06-14 15:38:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919391405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:28,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698802299] [2024-06-14 15:38:28,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:28,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:29,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:29,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 882 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:29,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:29,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:29,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:29,361 INFO L124 PetriNetUnfolderBase]: 308/552 cut-off events. [2024-06-14 15:38:29,362 INFO L125 PetriNetUnfolderBase]: For 17486/17486 co-relation queries the response was YES. [2024-06-14 15:38:29,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 552 events. 308/552 cut-off events. For 17486/17486 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2234 event pairs, 46 based on Foata normal form. 1/551 useless extension candidates. Maximal degree in co-relation 3087. Up to 485 conditions per place. [2024-06-14 15:38:29,414 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 21 changer transitions 0/123 dead transitions. [2024-06-14 15:38:29,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 123 transitions, 1172 flow [2024-06-14 15:38:29,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:38:29,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-14 15:38:29,429 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 882 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:38:29,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 123 transitions, 1172 flow [2024-06-14 15:38:29,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 123 transitions, 1140 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:38:29,453 INFO L231 Difference]: Finished difference. Result has 128 places, 105 transitions, 900 flow [2024-06-14 15:38:29,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=900, PETRI_PLACES=128, PETRI_TRANSITIONS=105} [2024-06-14 15:38:29,454 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 97 predicate places. [2024-06-14 15:38:29,454 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 105 transitions, 900 flow [2024-06-14 15:38:29,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:29,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:29,454 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:38:29,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:38:29,455 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:29,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1717141615, now seen corresponding path program 2 times [2024-06-14 15:38:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140145957] [2024-06-14 15:38:29,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:33,692 INFO 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:38:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140145957] [2024-06-14 15:38:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140145957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837720891] [2024-06-14 15:38:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:33,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:33,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:33,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:33,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 105 transitions, 900 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:33,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:33,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:33,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:34,097 INFO L124 PetriNetUnfolderBase]: 312/560 cut-off events. [2024-06-14 15:38:34,097 INFO L125 PetriNetUnfolderBase]: For 19119/19119 co-relation queries the response was YES. [2024-06-14 15:38:34,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 560 events. 312/560 cut-off events. For 19119/19119 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2273 event pairs, 48 based on Foata normal form. 2/560 useless extension candidates. Maximal degree in co-relation 3160. Up to 496 conditions per place. [2024-06-14 15:38:34,101 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 18 changer transitions 0/124 dead transitions. [2024-06-14 15:38:34,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 124 transitions, 1200 flow [2024-06-14 15:38:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 15:38:34,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 15:38:34,126 INFO L175 Difference]: Start difference. First operand has 128 places, 105 transitions, 900 flow. Second operand 9 states and 97 transitions. [2024-06-14 15:38:34,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 124 transitions, 1200 flow [2024-06-14 15:38:34,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 1102 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:38:34,152 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 855 flow [2024-06-14 15:38:34,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=855, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2024-06-14 15:38:34,154 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-14 15:38:34,154 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 855 flow [2024-06-14 15:38:34,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:34,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:34,154 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:38:34,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:38:34,155 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:34,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:34,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1717137895, now seen corresponding path program 3 times [2024-06-14 15:38:34,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:34,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992642633] [2024-06-14 15:38:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:38,377 INFO 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:38:38,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992642633] [2024-06-14 15:38:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992642633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:38,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201361759] [2024-06-14 15:38:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:38,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:38,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:38,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 855 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:38,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:38,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:38,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:38,749 INFO L124 PetriNetUnfolderBase]: 316/568 cut-off events. [2024-06-14 15:38:38,750 INFO L125 PetriNetUnfolderBase]: For 19260/19260 co-relation queries the response was YES. [2024-06-14 15:38:38,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3222 conditions, 568 events. 316/568 cut-off events. For 19260/19260 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2347 event pairs, 46 based on Foata normal form. 2/568 useless extension candidates. Maximal degree in co-relation 3158. Up to 488 conditions per place. [2024-06-14 15:38:38,753 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 105 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2024-06-14 15:38:38,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 1157 flow [2024-06-14 15:38:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:38:38,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-14 15:38:38,756 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 855 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:38:38,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 1157 flow [2024-06-14 15:38:38,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 125 transitions, 1116 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:38:38,785 INFO L231 Difference]: Finished difference. Result has 129 places, 107 transitions, 868 flow [2024-06-14 15:38:38,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=129, PETRI_TRANSITIONS=107} [2024-06-14 15:38:38,795 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-14 15:38:38,796 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 107 transitions, 868 flow [2024-06-14 15:38:38,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:38,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:38,796 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:38:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:38:38,796 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:38,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1339466899, now seen corresponding path program 1 times [2024-06-14 15:38:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:38,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567772890] [2024-06-14 15:38:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:43,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567772890] [2024-06-14 15:38:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567772890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:43,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172178493] [2024-06-14 15:38:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:43,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:43,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:43,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 107 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:43,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:43,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:43,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:43,516 INFO L124 PetriNetUnfolderBase]: 322/578 cut-off events. [2024-06-14 15:38:43,517 INFO L125 PetriNetUnfolderBase]: For 20257/20257 co-relation queries the response was YES. [2024-06-14 15:38:43,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 578 events. 322/578 cut-off events. For 20257/20257 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2395 event pairs, 45 based on Foata normal form. 2/578 useless extension candidates. Maximal degree in co-relation 3219. Up to 512 conditions per place. [2024-06-14 15:38:43,521 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 109 selfloop transitions, 18 changer transitions 0/129 dead transitions. [2024-06-14 15:38:43,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 129 transitions, 1191 flow [2024-06-14 15:38:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:38:43,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:38:43,522 INFO L175 Difference]: Start difference. First operand has 129 places, 107 transitions, 868 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:38:43,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 129 transitions, 1191 flow [2024-06-14 15:38:43,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 1147 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:38:43,555 INFO L231 Difference]: Finished difference. Result has 132 places, 109 transitions, 884 flow [2024-06-14 15:38:43,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=884, PETRI_PLACES=132, PETRI_TRANSITIONS=109} [2024-06-14 15:38:43,556 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-14 15:38:43,556 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 109 transitions, 884 flow [2024-06-14 15:38:43,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:43,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:43,557 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:38:43,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:38:43,557 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:43,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2054836295, now seen corresponding path program 2 times [2024-06-14 15:38:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280005095] [2024-06-14 15:38:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:47,631 INFO 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:38:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280005095] [2024-06-14 15:38:47,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280005095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:47,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:47,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:47,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700634923] [2024-06-14 15:38:47,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:47,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:47,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:47,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:47,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:47,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:47,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 109 transitions, 884 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:47,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:47,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:47,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:48,050 INFO L124 PetriNetUnfolderBase]: 334/598 cut-off events. [2024-06-14 15:38:48,050 INFO L125 PetriNetUnfolderBase]: For 22776/22776 co-relation queries the response was YES. [2024-06-14 15:38:48,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 598 events. 334/598 cut-off events. For 22776/22776 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2496 event pairs, 37 based on Foata normal form. 4/600 useless extension candidates. Maximal degree in co-relation 3322. Up to 289 conditions per place. [2024-06-14 15:38:48,054 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 74 selfloop transitions, 60 changer transitions 0/136 dead transitions. [2024-06-14 15:38:48,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 136 transitions, 1423 flow [2024-06-14 15:38:48,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:38:48,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:38:48,055 INFO L175 Difference]: Start difference. First operand has 132 places, 109 transitions, 884 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:38:48,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 136 transitions, 1423 flow [2024-06-14 15:38:48,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 1384 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 15:38:48,087 INFO L231 Difference]: Finished difference. Result has 134 places, 115 transitions, 1026 flow [2024-06-14 15:38:48,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1026, PETRI_PLACES=134, PETRI_TRANSITIONS=115} [2024-06-14 15:38:48,090 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-14 15:38:48,090 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 115 transitions, 1026 flow [2024-06-14 15:38:48,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:48,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:48,091 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:38:48,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:38:48,095 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:48,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1864958977, now seen corresponding path program 3 times [2024-06-14 15:38:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805422234] [2024-06-14 15:38:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805422234] [2024-06-14 15:38:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805422234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:52,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600710038] [2024-06-14 15:38:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:52,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:52,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:52,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:52,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 115 transitions, 1026 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:52,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:52,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:52,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:53,109 INFO L124 PetriNetUnfolderBase]: 340/608 cut-off events. [2024-06-14 15:38:53,109 INFO L125 PetriNetUnfolderBase]: For 22609/22609 co-relation queries the response was YES. [2024-06-14 15:38:53,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3605 conditions, 608 events. 340/608 cut-off events. For 22609/22609 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2557 event pairs, 43 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3538. Up to 291 conditions per place. [2024-06-14 15:38:53,113 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 78 selfloop transitions, 58 changer transitions 0/138 dead transitions. [2024-06-14 15:38:53,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 138 transitions, 1549 flow [2024-06-14 15:38:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:38:53,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:38:53,115 INFO L175 Difference]: Start difference. First operand has 134 places, 115 transitions, 1026 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:38:53,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 138 transitions, 1549 flow [2024-06-14 15:38:53,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 1487 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 15:38:53,152 INFO L231 Difference]: Finished difference. Result has 139 places, 117 transitions, 1110 flow [2024-06-14 15:38:53,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1110, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2024-06-14 15:38:53,153 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-14 15:38:53,153 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 1110 flow [2024-06-14 15:38:53,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:53,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:53,154 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:38:53,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:38:53,154 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:53,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2055051497, now seen corresponding path program 4 times [2024-06-14 15:38:53,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:53,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206200355] [2024-06-14 15:38:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:53,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:57,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:38:57,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206200355] [2024-06-14 15:38:57,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206200355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:57,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:57,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:57,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650433348] [2024-06-14 15:38:57,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:57,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:57,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:57,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:57,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:57,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:38:57,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 1110 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:57,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:57,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:38:57,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:57,988 INFO L124 PetriNetUnfolderBase]: 344/616 cut-off events. [2024-06-14 15:38:57,988 INFO L125 PetriNetUnfolderBase]: For 24008/24008 co-relation queries the response was YES. [2024-06-14 15:38:57,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 616 events. 344/616 cut-off events. For 24008/24008 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2603 event pairs, 39 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3707. Up to 498 conditions per place. [2024-06-14 15:38:57,994 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 99 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-06-14 15:38:57,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 134 transitions, 1430 flow [2024-06-14 15:38:57,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:38:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:38:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 15:38:57,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-14 15:38:57,995 INFO L175 Difference]: Start difference. First operand has 139 places, 117 transitions, 1110 flow. Second operand 9 states and 101 transitions. [2024-06-14 15:38:57,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 134 transitions, 1430 flow [2024-06-14 15:38:58,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 1327 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:38:58,037 INFO L231 Difference]: Finished difference. Result has 141 places, 118 transitions, 1093 flow [2024-06-14 15:38:58,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1093, PETRI_PLACES=141, PETRI_TRANSITIONS=118} [2024-06-14 15:38:58,038 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-14 15:38:58,038 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 118 transitions, 1093 flow [2024-06-14 15:38:58,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38:58,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:58,039 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:38:58,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:38:58,039 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:58,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:58,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2055045545, now seen corresponding path program 4 times [2024-06-14 15:38:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:58,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361693749] [2024-06-14 15:38:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:02,209 INFO 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:39:02,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361693749] [2024-06-14 15:39:02,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361693749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:02,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:02,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:02,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108546947] [2024-06-14 15:39:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:02,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:02,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:02,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:02,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:02,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:02,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 118 transitions, 1093 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:02,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:02,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:02,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:02,614 INFO L124 PetriNetUnfolderBase]: 350/626 cut-off events. [2024-06-14 15:39:02,614 INFO L125 PetriNetUnfolderBase]: For 25065/25065 co-relation queries the response was YES. [2024-06-14 15:39:02,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 626 events. 350/626 cut-off events. For 25065/25065 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2650 event pairs, 45 based on Foata normal form. 2/626 useless extension candidates. Maximal degree in co-relation 3735. Up to 301 conditions per place. [2024-06-14 15:39:02,619 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 82 selfloop transitions, 57 changer transitions 0/141 dead transitions. [2024-06-14 15:39:02,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 141 transitions, 1633 flow [2024-06-14 15:39:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:39:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:39:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:39:02,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:39:02,621 INFO L175 Difference]: Start difference. First operand has 141 places, 118 transitions, 1093 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:39:02,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 141 transitions, 1633 flow [2024-06-14 15:39:02,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 1557 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:02,665 INFO L231 Difference]: Finished difference. Result has 144 places, 120 transitions, 1164 flow [2024-06-14 15:39:02,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1164, PETRI_PLACES=144, PETRI_TRANSITIONS=120} [2024-06-14 15:39:02,666 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-14 15:39:02,666 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 120 transitions, 1164 flow [2024-06-14 15:39:02,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:02,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:02,666 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:39:02,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:39:02,667 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:02,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2060558027, now seen corresponding path program 5 times [2024-06-14 15:39:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346949391] [2024-06-14 15:39:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:06,895 INFO 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:39:06,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346949391] [2024-06-14 15:39:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346949391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:06,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:06,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:06,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65419233] [2024-06-14 15:39:06,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:06,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:06,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:06,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 120 transitions, 1164 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:06,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:06,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:06,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:07,280 INFO L124 PetriNetUnfolderBase]: 354/634 cut-off events. [2024-06-14 15:39:07,281 INFO L125 PetriNetUnfolderBase]: For 26451/26451 co-relation queries the response was YES. [2024-06-14 15:39:07,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 634 events. 354/634 cut-off events. For 26451/26451 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2720 event pairs, 43 based on Foata normal form. 2/634 useless extension candidates. Maximal degree in co-relation 3859. Up to 516 conditions per place. [2024-06-14 15:39:07,284 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 106 selfloop transitions, 29 changer transitions 0/137 dead transitions. [2024-06-14 15:39:07,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 137 transitions, 1492 flow [2024-06-14 15:39:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:39:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:39:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-14 15:39:07,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2024-06-14 15:39:07,286 INFO L175 Difference]: Start difference. First operand has 144 places, 120 transitions, 1164 flow. Second operand 9 states and 100 transitions. [2024-06-14 15:39:07,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 137 transitions, 1492 flow [2024-06-14 15:39:07,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 137 transitions, 1396 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:07,330 INFO L231 Difference]: Finished difference. Result has 146 places, 121 transitions, 1148 flow [2024-06-14 15:39:07,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2024-06-14 15:39:07,331 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-14 15:39:07,331 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 1148 flow [2024-06-14 15:39:07,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:07,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:07,331 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:39:07,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:39:07,332 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:07,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2060407925, now seen corresponding path program 5 times [2024-06-14 15:39:07,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:07,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005825623] [2024-06-14 15:39:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:07,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:11,584 INFO 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:39:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005825623] [2024-06-14 15:39:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005825623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405735301] [2024-06-14 15:39:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:11,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:11,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:11,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 121 transitions, 1148 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:11,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:11,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:11,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:11,971 INFO L124 PetriNetUnfolderBase]: 364/650 cut-off events. [2024-06-14 15:39:11,971 INFO L125 PetriNetUnfolderBase]: For 28500/28500 co-relation queries the response was YES. [2024-06-14 15:39:11,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 650 events. 364/650 cut-off events. For 28500/28500 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2790 event pairs, 53 based on Foata normal form. 2/650 useless extension candidates. Maximal degree in co-relation 3951. Up to 319 conditions per place. [2024-06-14 15:39:11,976 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 83 selfloop transitions, 61 changer transitions 0/146 dead transitions. [2024-06-14 15:39:11,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 146 transitions, 1727 flow [2024-06-14 15:39:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:39:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:39:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:39:11,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:39:11,979 INFO L175 Difference]: Start difference. First operand has 146 places, 121 transitions, 1148 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:39:11,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 146 transitions, 1727 flow [2024-06-14 15:39:12,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 146 transitions, 1657 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:12,031 INFO L231 Difference]: Finished difference. Result has 150 places, 126 transitions, 1304 flow [2024-06-14 15:39:12,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1304, PETRI_PLACES=150, PETRI_TRANSITIONS=126} [2024-06-14 15:39:12,032 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-14 15:39:12,032 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 126 transitions, 1304 flow [2024-06-14 15:39:12,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:12,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:12,033 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:39:12,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:39:12,033 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:12,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1861033261, now seen corresponding path program 6 times [2024-06-14 15:39:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132075746] [2024-06-14 15:39:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:16,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:16,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132075746] [2024-06-14 15:39:16,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132075746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:16,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:16,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593966592] [2024-06-14 15:39:16,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:16,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:16,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:16,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:16,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:16,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 126 transitions, 1304 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:16,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:16,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:16,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:16,950 INFO L124 PetriNetUnfolderBase]: 361/645 cut-off events. [2024-06-14 15:39:16,951 INFO L125 PetriNetUnfolderBase]: For 27980/27980 co-relation queries the response was YES. [2024-06-14 15:39:16,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 645 events. 361/645 cut-off events. For 27980/27980 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2767 event pairs, 44 based on Foata normal form. 2/645 useless extension candidates. Maximal degree in co-relation 4010. Up to 491 conditions per place. [2024-06-14 15:39:16,956 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 108 selfloop transitions, 32 changer transitions 0/142 dead transitions. [2024-06-14 15:39:16,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 142 transitions, 1624 flow [2024-06-14 15:39:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:39:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:39:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-14 15:39:16,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2024-06-14 15:39:16,957 INFO L175 Difference]: Start difference. First operand has 150 places, 126 transitions, 1304 flow. Second operand 9 states and 100 transitions. [2024-06-14 15:39:16,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 142 transitions, 1624 flow [2024-06-14 15:39:17,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 142 transitions, 1555 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:17,014 INFO L231 Difference]: Finished difference. Result has 153 places, 126 transitions, 1304 flow [2024-06-14 15:39:17,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1304, PETRI_PLACES=153, PETRI_TRANSITIONS=126} [2024-06-14 15:39:17,014 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-14 15:39:17,014 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 126 transitions, 1304 flow [2024-06-14 15:39:17,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:17,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:17,015 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:39:17,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:39:17,015 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:17,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash -874771655, now seen corresponding path program 6 times [2024-06-14 15:39:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:17,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500445107] [2024-06-14 15:39:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:17,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:21,162 INFO 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:39:21,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500445107] [2024-06-14 15:39:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500445107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:21,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:21,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12673159] [2024-06-14 15:39:21,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:21,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:21,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:21,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:21,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:21,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 126 transitions, 1304 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:21,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:21,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:21,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:21,577 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-06-14 15:39:21,577 INFO L125 PetriNetUnfolderBase]: For 29339/29339 co-relation queries the response was YES. [2024-06-14 15:39:21,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 655 events. 367/655 cut-off events. For 29339/29339 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2822 event pairs, 53 based on Foata normal form. 2/655 useless extension candidates. Maximal degree in co-relation 4029. Up to 316 conditions per place. [2024-06-14 15:39:21,582 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 88 selfloop transitions, 59 changer transitions 0/149 dead transitions. [2024-06-14 15:39:21,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 149 transitions, 1952 flow [2024-06-14 15:39:21,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:39:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:39:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:39:21,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:39:21,584 INFO L175 Difference]: Start difference. First operand has 153 places, 126 transitions, 1304 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:39:21,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 149 transitions, 1952 flow [2024-06-14 15:39:21,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 1875 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:21,645 INFO L231 Difference]: Finished difference. Result has 156 places, 128 transitions, 1372 flow [2024-06-14 15:39:21,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1372, PETRI_PLACES=156, PETRI_TRANSITIONS=128} [2024-06-14 15:39:21,646 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-14 15:39:21,646 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 128 transitions, 1372 flow [2024-06-14 15:39:21,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:21,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:21,646 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:39:21,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:39:21,647 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:21,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash -874562405, now seen corresponding path program 7 times [2024-06-14 15:39:21,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:21,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430644560] [2024-06-14 15:39:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:21,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:25,941 INFO 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:39:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430644560] [2024-06-14 15:39:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430644560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:25,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842481396] [2024-06-14 15:39:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:25,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:26,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:26,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 128 transitions, 1372 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:26,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:26,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:26,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:26,358 INFO L124 PetriNetUnfolderBase]: 406/719 cut-off events. [2024-06-14 15:39:26,359 INFO L125 PetriNetUnfolderBase]: For 38681/38681 co-relation queries the response was YES. [2024-06-14 15:39:26,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 719 events. 406/719 cut-off events. For 38681/38681 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3137 event pairs, 59 based on Foata normal form. 4/721 useless extension candidates. Maximal degree in co-relation 4662. Up to 342 conditions per place. [2024-06-14 15:39:26,364 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 94 selfloop transitions, 62 changer transitions 0/158 dead transitions. [2024-06-14 15:39:26,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 158 transitions, 2143 flow [2024-06-14 15:39:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:39:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:39:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:39:26,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:39:26,366 INFO L175 Difference]: Start difference. First operand has 156 places, 128 transitions, 1372 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:39:26,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 158 transitions, 2143 flow [2024-06-14 15:39:26,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 158 transitions, 1947 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 15:39:26,439 INFO L231 Difference]: Finished difference. Result has 158 places, 136 transitions, 1435 flow [2024-06-14 15:39:26,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1435, PETRI_PLACES=158, PETRI_TRANSITIONS=136} [2024-06-14 15:39:26,440 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-14 15:39:26,440 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 136 transitions, 1435 flow [2024-06-14 15:39:26,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:26,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:26,441 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:39:26,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:39:26,441 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:26,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash -608864846, now seen corresponding path program 1 times [2024-06-14 15:39:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:26,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942026059] [2024-06-14 15:39:26,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:26,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:31,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 15:39:31,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942026059] [2024-06-14 15:39:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942026059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:31,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:31,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:39:31,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632569642] [2024-06-14 15:39:31,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:31,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:39:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:31,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:39:31,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:39:31,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:31,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 136 transitions, 1435 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:39:31,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:31,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:31,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:31,886 INFO L124 PetriNetUnfolderBase]: 409/724 cut-off events. [2024-06-14 15:39:31,887 INFO L125 PetriNetUnfolderBase]: For 36326/36326 co-relation queries the response was YES. [2024-06-14 15:39:31,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 724 events. 409/724 cut-off events. For 36326/36326 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3157 event pairs, 74 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 4705. Up to 656 conditions per place. [2024-06-14 15:39:31,892 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 30 changer transitions 0/152 dead transitions. [2024-06-14 15:39:31,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 152 transitions, 1795 flow [2024-06-14 15:39:31,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:39:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:39:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-14 15:39:31,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2024-06-14 15:39:31,894 INFO L175 Difference]: Start difference. First operand has 158 places, 136 transitions, 1435 flow. Second operand 11 states and 114 transitions. [2024-06-14 15:39:31,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 152 transitions, 1795 flow [2024-06-14 15:39:31,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 152 transitions, 1682 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:31,975 INFO L231 Difference]: Finished difference. Result has 163 places, 138 transitions, 1419 flow [2024-06-14 15:39:31,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1419, PETRI_PLACES=163, PETRI_TRANSITIONS=138} [2024-06-14 15:39:31,976 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-14 15:39:31,976 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 138 transitions, 1419 flow [2024-06-14 15:39:31,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:39:31,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:31,976 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:39:31,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:39:31,976 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:31,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1404548095, now seen corresponding path program 8 times [2024-06-14 15:39:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:31,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935223439] [2024-06-14 15:39:31,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:36,130 INFO 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:39:36,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:36,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935223439] [2024-06-14 15:39:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935223439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:36,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:36,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628415980] [2024-06-14 15:39:36,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:36,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:36,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:36,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:36,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:36,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 138 transitions, 1419 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:36,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:36,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:36,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:36,506 INFO L124 PetriNetUnfolderBase]: 405/718 cut-off events. [2024-06-14 15:39:36,507 INFO L125 PetriNetUnfolderBase]: For 36269/36269 co-relation queries the response was YES. [2024-06-14 15:39:36,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4596 conditions, 718 events. 405/718 cut-off events. For 36269/36269 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3149 event pairs, 58 based on Foata normal form. 2/718 useless extension candidates. Maximal degree in co-relation 4518. Up to 343 conditions per place. [2024-06-14 15:39:36,514 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 95 selfloop transitions, 63 changer transitions 0/160 dead transitions. [2024-06-14 15:39:36,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 160 transitions, 2095 flow [2024-06-14 15:39:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:39:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:39:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:39:36,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:39:36,516 INFO L175 Difference]: Start difference. First operand has 163 places, 138 transitions, 1419 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:39:36,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 160 transitions, 2095 flow [2024-06-14 15:39:36,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 2024 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:39:36,600 INFO L231 Difference]: Finished difference. Result has 164 places, 139 transitions, 1491 flow [2024-06-14 15:39:36,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1491, PETRI_PLACES=164, PETRI_TRANSITIONS=139} [2024-06-14 15:39:36,602 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-14 15:39:36,602 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 139 transitions, 1491 flow [2024-06-14 15:39:36,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:36,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:36,602 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:39:36,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:39:36,602 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:36,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1394423036, now seen corresponding path program 2 times [2024-06-14 15:39:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393181465] [2024-06-14 15:39:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:41,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:41,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393181465] [2024-06-14 15:39:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393181465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:41,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:41,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:41,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778438733] [2024-06-14 15:39:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:41,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:41,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:41,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:41,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:41,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 139 transitions, 1491 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:41,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:41,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:41,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:41,556 INFO L124 PetriNetUnfolderBase]: 397/705 cut-off events. [2024-06-14 15:39:41,556 INFO L125 PetriNetUnfolderBase]: For 35502/35502 co-relation queries the response was YES. [2024-06-14 15:39:41,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 705 events. 397/705 cut-off events. For 35502/35502 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3073 event pairs, 57 based on Foata normal form. 3/706 useless extension candidates. Maximal degree in co-relation 4433. Up to 415 conditions per place. [2024-06-14 15:39:41,561 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 95 selfloop transitions, 62 changer transitions 0/159 dead transitions. [2024-06-14 15:39:41,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 159 transitions, 2059 flow [2024-06-14 15:39:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:39:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:39:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:39:41,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:39:41,562 INFO L175 Difference]: Start difference. First operand has 164 places, 139 transitions, 1491 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:39:41,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 159 transitions, 2059 flow [2024-06-14 15:39:41,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 159 transitions, 1929 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:41,627 INFO L231 Difference]: Finished difference. Result has 167 places, 139 transitions, 1494 flow [2024-06-14 15:39:41,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=167, PETRI_TRANSITIONS=139} [2024-06-14 15:39:41,627 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-14 15:39:41,628 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 139 transitions, 1494 flow [2024-06-14 15:39:41,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:39:41,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:41,628 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:39:41,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:39:41,628 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:41,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:41,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1148047585, now seen corresponding path program 9 times [2024-06-14 15:39:41,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:41,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721584593] [2024-06-14 15:39:41,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:41,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:45,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721584593] [2024-06-14 15:39:45,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721584593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:45,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:45,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:39:45,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436642678] [2024-06-14 15:39:45,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:45,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:39:45,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:45,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:39:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:39:45,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:45,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 139 transitions, 1494 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:39:45,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:45,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:45,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:46,289 INFO L124 PetriNetUnfolderBase]: 403/715 cut-off events. [2024-06-14 15:39:46,290 INFO L125 PetriNetUnfolderBase]: For 35573/35573 co-relation queries the response was YES. [2024-06-14 15:39:46,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4597 conditions, 715 events. 403/715 cut-off events. For 35573/35573 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3155 event pairs, 44 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4517. Up to 338 conditions per place. [2024-06-14 15:39:46,296 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 89 selfloop transitions, 73 changer transitions 0/164 dead transitions. [2024-06-14 15:39:46,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 164 transitions, 2217 flow [2024-06-14 15:39:46,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:39:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:39:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:39:46,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:39:46,297 INFO L175 Difference]: Start difference. First operand has 167 places, 139 transitions, 1494 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:39:46,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 164 transitions, 2217 flow [2024-06-14 15:39:46,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 164 transitions, 2063 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:39:46,365 INFO L231 Difference]: Finished difference. Result has 169 places, 141 transitions, 1522 flow [2024-06-14 15:39:46,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1522, PETRI_PLACES=169, PETRI_TRANSITIONS=141} [2024-06-14 15:39:46,366 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-14 15:39:46,366 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 141 transitions, 1522 flow [2024-06-14 15:39:46,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:39:46,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:46,367 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:39:46,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:39:46,368 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:46,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash -618061616, now seen corresponding path program 3 times [2024-06-14 15:39:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:46,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247615518] [2024-06-14 15:39:46,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:51,190 INFO 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:39:51,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247615518] [2024-06-14 15:39:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247615518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:51,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:39:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431889622] [2024-06-14 15:39:51,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:51,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:39:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:39:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:39:51,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:51,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 141 transitions, 1522 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:39:51,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:51,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:51,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:51,641 INFO L124 PetriNetUnfolderBase]: 406/720 cut-off events. [2024-06-14 15:39:51,641 INFO L125 PetriNetUnfolderBase]: For 35494/35494 co-relation queries the response was YES. [2024-06-14 15:39:51,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 720 events. 406/720 cut-off events. For 35494/35494 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3157 event pairs, 68 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 4604. Up to 652 conditions per place. [2024-06-14 15:39:51,647 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 125 selfloop transitions, 30 changer transitions 0/157 dead transitions. [2024-06-14 15:39:51,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 157 transitions, 1899 flow [2024-06-14 15:39:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:39:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:39:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 15:39:51,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-14 15:39:51,648 INFO L175 Difference]: Start difference. First operand has 169 places, 141 transitions, 1522 flow. Second operand 11 states and 115 transitions. [2024-06-14 15:39:51,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 157 transitions, 1899 flow [2024-06-14 15:39:51,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 157 transitions, 1661 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-14 15:39:51,722 INFO L231 Difference]: Finished difference. Result has 168 places, 143 transitions, 1388 flow [2024-06-14 15:39:51,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1388, PETRI_PLACES=168, PETRI_TRANSITIONS=143} [2024-06-14 15:39:51,723 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-14 15:39:51,723 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 143 transitions, 1388 flow [2024-06-14 15:39:51,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:39:51,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:51,724 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:39:51,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:39:51,724 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:51,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1366577095, now seen corresponding path program 10 times [2024-06-14 15:39:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063609282] [2024-06-14 15:39:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:51,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:56,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:56,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063609282] [2024-06-14 15:39:56,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063609282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:56,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:56,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:39:56,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34285965] [2024-06-14 15:39:56,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:56,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:39:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:56,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:39:56,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:39:56,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:39:56,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 143 transitions, 1388 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:39:56,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:56,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:39:56,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:56,918 INFO L124 PetriNetUnfolderBase]: 428/756 cut-off events. [2024-06-14 15:39:56,918 INFO L125 PetriNetUnfolderBase]: For 43233/43233 co-relation queries the response was YES. [2024-06-14 15:39:56,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 756 events. 428/756 cut-off events. For 43233/43233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3356 event pairs, 51 based on Foata normal form. 4/758 useless extension candidates. Maximal degree in co-relation 4663. Up to 357 conditions per place. [2024-06-14 15:39:56,924 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 94 selfloop transitions, 76 changer transitions 0/172 dead transitions. [2024-06-14 15:39:56,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 172 transitions, 2172 flow [2024-06-14 15:39:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:39:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:39:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:39:56,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:39:56,926 INFO L175 Difference]: Start difference. First operand has 168 places, 143 transitions, 1388 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:39:56,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 172 transitions, 2172 flow [2024-06-14 15:39:57,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 172 transitions, 2099 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:39:57,012 INFO L231 Difference]: Finished difference. Result has 170 places, 149 transitions, 1541 flow [2024-06-14 15:39:57,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1541, PETRI_PLACES=170, PETRI_TRANSITIONS=149} [2024-06-14 15:39:57,013 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-14 15:39:57,013 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 149 transitions, 1541 flow [2024-06-14 15:39:57,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:39:57,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:57,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:57,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:39:57,013 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:39:57,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -608865125, now seen corresponding path program 11 times [2024-06-14 15:39:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193880013] [2024-06-14 15:39:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:01,276 INFO 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:40:01,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:01,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193880013] [2024-06-14 15:40:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193880013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:01,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:01,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436789137] [2024-06-14 15:40:01,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:01,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:01,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:01,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 149 transitions, 1541 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:40:01,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:01,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:01,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:01,825 INFO L124 PetriNetUnfolderBase]: 422/748 cut-off events. [2024-06-14 15:40:01,825 INFO L125 PetriNetUnfolderBase]: For 39443/39443 co-relation queries the response was YES. [2024-06-14 15:40:01,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 748 events. 422/748 cut-off events. For 39443/39443 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3328 event pairs, 47 based on Foata normal form. 4/750 useless extension candidates. Maximal degree in co-relation 4584. Up to 356 conditions per place. [2024-06-14 15:40:01,831 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 89 selfloop transitions, 81 changer transitions 0/172 dead transitions. [2024-06-14 15:40:01,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 172 transitions, 2267 flow [2024-06-14 15:40:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:40:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:40:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:40:01,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:40:01,833 INFO L175 Difference]: Start difference. First operand has 170 places, 149 transitions, 1541 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:40:01,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 172 transitions, 2267 flow [2024-06-14 15:40:01,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 172 transitions, 2112 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 15:40:01,916 INFO L231 Difference]: Finished difference. Result has 174 places, 149 transitions, 1557 flow [2024-06-14 15:40:01,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1557, PETRI_PLACES=174, PETRI_TRANSITIONS=149} [2024-06-14 15:40:01,916 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-14 15:40:01,917 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 149 transitions, 1557 flow [2024-06-14 15:40:01,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:40:01,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:01,917 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:40:01,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:40:01,917 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:01,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1138516666, now seen corresponding path program 4 times [2024-06-14 15:40:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288892167] [2024-06-14 15:40:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:06,976 INFO 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:40:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288892167] [2024-06-14 15:40:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288892167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:06,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:06,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31017382] [2024-06-14 15:40:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:06,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:07,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:07,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 149 transitions, 1557 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:40:07,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:07,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:07,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:07,419 INFO L124 PetriNetUnfolderBase]: 418/741 cut-off events. [2024-06-14 15:40:07,419 INFO L125 PetriNetUnfolderBase]: For 34903/34903 co-relation queries the response was YES. [2024-06-14 15:40:07,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 741 events. 418/741 cut-off events. For 34903/34903 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3263 event pairs, 69 based on Foata normal form. 1/740 useless extension candidates. Maximal degree in co-relation 4518. Up to 664 conditions per place. [2024-06-14 15:40:07,424 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 128 selfloop transitions, 35 changer transitions 0/165 dead transitions. [2024-06-14 15:40:07,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 165 transitions, 1932 flow [2024-06-14 15:40:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:40:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:40:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2024-06-14 15:40:07,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3203125 [2024-06-14 15:40:07,425 INFO L175 Difference]: Start difference. First operand has 174 places, 149 transitions, 1557 flow. Second operand 12 states and 123 transitions. [2024-06-14 15:40:07,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 165 transitions, 1932 flow [2024-06-14 15:40:07,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 165 transitions, 1750 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:40:07,498 INFO L231 Difference]: Finished difference. Result has 176 places, 150 transitions, 1467 flow [2024-06-14 15:40:07,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1467, PETRI_PLACES=176, PETRI_TRANSITIONS=150} [2024-06-14 15:40:07,498 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-14 15:40:07,498 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 1467 flow [2024-06-14 15:40:07,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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:40:07,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:07,499 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:40:07,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:40:07,499 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:07,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1324106634, now seen corresponding path program 1 times [2024-06-14 15:40:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590854949] [2024-06-14 15:40:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590854949] [2024-06-14 15:40:11,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590854949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:11,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:11,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:11,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469574612] [2024-06-14 15:40:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:11,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:11,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:11,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:11,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:11,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:11,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 1467 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:11,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:11,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:11,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:12,307 INFO L124 PetriNetUnfolderBase]: 422/749 cut-off events. [2024-06-14 15:40:12,308 INFO L125 PetriNetUnfolderBase]: For 37406/37406 co-relation queries the response was YES. [2024-06-14 15:40:12,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 749 events. 422/749 cut-off events. For 37406/37406 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3344 event pairs, 49 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 4424. Up to 671 conditions per place. [2024-06-14 15:40:12,314 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 156 selfloop transitions, 13 changer transitions 0/171 dead transitions. [2024-06-14 15:40:12,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 171 transitions, 1859 flow [2024-06-14 15:40:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-14 15:40:12,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31875 [2024-06-14 15:40:12,316 INFO L175 Difference]: Start difference. First operand has 176 places, 150 transitions, 1467 flow. Second operand 10 states and 102 transitions. [2024-06-14 15:40:12,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 171 transitions, 1859 flow [2024-06-14 15:40:12,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 171 transitions, 1774 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-14 15:40:12,384 INFO L231 Difference]: Finished difference. Result has 176 places, 151 transitions, 1422 flow [2024-06-14 15:40:12,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1422, PETRI_PLACES=176, PETRI_TRANSITIONS=151} [2024-06-14 15:40:12,384 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-14 15:40:12,384 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 151 transitions, 1422 flow [2024-06-14 15:40:12,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:12,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:12,385 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:40:12,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:40:12,385 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:12,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1310729562, now seen corresponding path program 1 times [2024-06-14 15:40:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002849276] [2024-06-14 15:40:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:16,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:16,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002849276] [2024-06-14 15:40:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002849276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:16,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:16,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98693094] [2024-06-14 15:40:16,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:16,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:16,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:16,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:16,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:16,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 151 transitions, 1422 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:16,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:16,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:16,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:17,252 INFO L124 PetriNetUnfolderBase]: 419/744 cut-off events. [2024-06-14 15:40:17,252 INFO L125 PetriNetUnfolderBase]: For 35290/35290 co-relation queries the response was YES. [2024-06-14 15:40:17,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 744 events. 419/744 cut-off events. For 35290/35290 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3316 event pairs, 60 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 4307. Up to 666 conditions per place. [2024-06-14 15:40:17,258 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 25 changer transitions 0/171 dead transitions. [2024-06-14 15:40:17,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 171 transitions, 1814 flow [2024-06-14 15:40:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:40:17,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:40:17,260 INFO L175 Difference]: Start difference. First operand has 176 places, 151 transitions, 1422 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:40:17,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 171 transitions, 1814 flow [2024-06-14 15:40:17,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 171 transitions, 1780 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:17,332 INFO L231 Difference]: Finished difference. Result has 178 places, 151 transitions, 1446 flow [2024-06-14 15:40:17,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1446, PETRI_PLACES=178, PETRI_TRANSITIONS=151} [2024-06-14 15:40:17,332 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-14 15:40:17,332 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 1446 flow [2024-06-14 15:40:17,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:17,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:17,333 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:40:17,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:40:17,333 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:17,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:17,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1265894214, now seen corresponding path program 2 times [2024-06-14 15:40:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:17,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221553260] [2024-06-14 15:40:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:21,794 INFO 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:40:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221553260] [2024-06-14 15:40:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221553260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477403241] [2024-06-14 15:40:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:21,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:21,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:21,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 151 transitions, 1446 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:21,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:21,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:21,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:22,269 INFO L124 PetriNetUnfolderBase]: 423/752 cut-off events. [2024-06-14 15:40:22,270 INFO L125 PetriNetUnfolderBase]: For 38156/38156 co-relation queries the response was YES. [2024-06-14 15:40:22,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4466 conditions, 752 events. 423/752 cut-off events. For 38156/38156 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3374 event pairs, 62 based on Foata normal form. 2/752 useless extension candidates. Maximal degree in co-relation 4381. Up to 677 conditions per place. [2024-06-14 15:40:22,275 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 148 selfloop transitions, 22 changer transitions 0/172 dead transitions. [2024-06-14 15:40:22,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 172 transitions, 1848 flow [2024-06-14 15:40:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:40:22,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-14 15:40:22,277 INFO L175 Difference]: Start difference. First operand has 178 places, 151 transitions, 1446 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:40:22,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 172 transitions, 1848 flow [2024-06-14 15:40:22,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 1670 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-06-14 15:40:22,344 INFO L231 Difference]: Finished difference. Result has 176 places, 152 transitions, 1329 flow [2024-06-14 15:40:22,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=176, PETRI_TRANSITIONS=152} [2024-06-14 15:40:22,345 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-14 15:40:22,345 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 152 transitions, 1329 flow [2024-06-14 15:40:22,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:22,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:22,345 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:40:22,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:40:22,346 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:22,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash 44462096, now seen corresponding path program 3 times [2024-06-14 15:40:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:22,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133833224] [2024-06-14 15:40:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:22,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:27,028 INFO 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:40:27,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:27,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133833224] [2024-06-14 15:40:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133833224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:27,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:27,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991827555] [2024-06-14 15:40:27,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:27,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:27,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:27,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 152 transitions, 1329 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:27,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:27,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:27,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:27,538 INFO L124 PetriNetUnfolderBase]: 427/760 cut-off events. [2024-06-14 15:40:27,539 INFO L125 PetriNetUnfolderBase]: For 37784/37784 co-relation queries the response was YES. [2024-06-14 15:40:27,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 760 events. 427/760 cut-off events. For 37784/37784 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3429 event pairs, 62 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 4285. Up to 669 conditions per place. [2024-06-14 15:40:27,549 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 149 selfloop transitions, 22 changer transitions 0/173 dead transitions. [2024-06-14 15:40:27,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 173 transitions, 1733 flow [2024-06-14 15:40:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:40:27,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:40:27,550 INFO L175 Difference]: Start difference. First operand has 176 places, 152 transitions, 1329 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:40:27,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 173 transitions, 1733 flow [2024-06-14 15:40:27,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 173 transitions, 1684 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:27,627 INFO L231 Difference]: Finished difference. Result has 178 places, 153 transitions, 1342 flow [2024-06-14 15:40:27,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1342, PETRI_PLACES=178, PETRI_TRANSITIONS=153} [2024-06-14 15:40:27,627 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-14 15:40:27,628 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 153 transitions, 1342 flow [2024-06-14 15:40:27,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:27,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:27,628 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:40:27,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:40:27,628 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:27,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1266014184, now seen corresponding path program 4 times [2024-06-14 15:40:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276936828] [2024-06-14 15:40:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:32,132 INFO 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:40:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276936828] [2024-06-14 15:40:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276936828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:32,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:32,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484842569] [2024-06-14 15:40:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:32,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:32,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:32,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:32,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 153 transitions, 1342 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:32,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:32,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:32,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:32,596 INFO L124 PetriNetUnfolderBase]: 431/768 cut-off events. [2024-06-14 15:40:32,596 INFO L125 PetriNetUnfolderBase]: For 39250/39250 co-relation queries the response was YES. [2024-06-14 15:40:32,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4432 conditions, 768 events. 431/768 cut-off events. For 39250/39250 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3491 event pairs, 64 based on Foata normal form. 2/768 useless extension candidates. Maximal degree in co-relation 4345. Up to 653 conditions per place. [2024-06-14 15:40:32,602 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 150 selfloop transitions, 22 changer transitions 0/174 dead transitions. [2024-06-14 15:40:32,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 174 transitions, 1748 flow [2024-06-14 15:40:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 15:40:32,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 15:40:32,603 INFO L175 Difference]: Start difference. First operand has 178 places, 153 transitions, 1342 flow. Second operand 10 states and 108 transitions. [2024-06-14 15:40:32,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 174 transitions, 1748 flow [2024-06-14 15:40:32,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 1696 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:32,668 INFO L231 Difference]: Finished difference. Result has 180 places, 154 transitions, 1354 flow [2024-06-14 15:40:32,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1354, PETRI_PLACES=180, PETRI_TRANSITIONS=154} [2024-06-14 15:40:32,669 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-14 15:40:32,669 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 154 transitions, 1354 flow [2024-06-14 15:40:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:32,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:32,669 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:40:32,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:40:32,670 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:32,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash 724348090, now seen corresponding path program 5 times [2024-06-14 15:40:32,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:32,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954530695] [2024-06-14 15:40:32,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:37,120 INFO 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:40:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954530695] [2024-06-14 15:40:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954530695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:37,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:37,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:40:37,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171544286] [2024-06-14 15:40:37,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:37,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:40:37,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:37,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:40:37,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:40:37,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:37,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 154 transitions, 1354 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40:37,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:37,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:37,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:37,511 INFO L124 PetriNetUnfolderBase]: 435/776 cut-off events. [2024-06-14 15:40:37,511 INFO L125 PetriNetUnfolderBase]: For 40656/40656 co-relation queries the response was YES. [2024-06-14 15:40:37,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 776 events. 435/776 cut-off events. For 40656/40656 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3548 event pairs, 41 based on Foata normal form. 2/776 useless extension candidates. Maximal degree in co-relation 4405. Up to 593 conditions per place. [2024-06-14 15:40:37,516 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 120 selfloop transitions, 51 changer transitions 0/173 dead transitions. [2024-06-14 15:40:37,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 173 transitions, 1760 flow [2024-06-14 15:40:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:40:37,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:40:37,518 INFO L175 Difference]: Start difference. First operand has 180 places, 154 transitions, 1354 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:40:37,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 173 transitions, 1760 flow [2024-06-14 15:40:37,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 173 transitions, 1706 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:37,596 INFO L231 Difference]: Finished difference. Result has 182 places, 155 transitions, 1424 flow [2024-06-14 15:40:37,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1424, PETRI_PLACES=182, PETRI_TRANSITIONS=155} [2024-06-14 15:40:37,597 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2024-06-14 15:40:37,597 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 155 transitions, 1424 flow [2024-06-14 15:40:37,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40:37,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:37,597 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:40:37,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:40:37,598 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:37,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 547216570, now seen corresponding path program 6 times [2024-06-14 15:40:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:37,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610335972] [2024-06-14 15:40:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:37,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:42,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:42,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610335972] [2024-06-14 15:40:42,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610335972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:42,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:42,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:40:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625136532] [2024-06-14 15:40:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:42,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:40:42,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:42,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:40:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:40:42,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:42,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 155 transitions, 1424 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40:42,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:42,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:42,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:42,478 INFO L124 PetriNetUnfolderBase]: 439/784 cut-off events. [2024-06-14 15:40:42,478 INFO L125 PetriNetUnfolderBase]: For 42179/42179 co-relation queries the response was YES. [2024-06-14 15:40:42,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 784 events. 439/784 cut-off events. For 42179/42179 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3607 event pairs, 47 based on Foata normal form. 2/784 useless extension candidates. Maximal degree in co-relation 4540. Up to 601 conditions per place. [2024-06-14 15:40:42,484 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 127 selfloop transitions, 45 changer transitions 0/174 dead transitions. [2024-06-14 15:40:42,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 174 transitions, 1834 flow [2024-06-14 15:40:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:40:42,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:40:42,486 INFO L175 Difference]: Start difference. First operand has 182 places, 155 transitions, 1424 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:40:42,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 174 transitions, 1834 flow [2024-06-14 15:40:42,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 174 transitions, 1720 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:42,564 INFO L231 Difference]: Finished difference. Result has 184 places, 156 transitions, 1424 flow [2024-06-14 15:40:42,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1424, PETRI_PLACES=184, PETRI_TRANSITIONS=156} [2024-06-14 15:40:42,564 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-14 15:40:42,564 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 156 transitions, 1424 flow [2024-06-14 15:40:42,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40:42,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:42,565 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:40:42,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:40:42,565 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:42,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:42,565 INFO L85 PathProgramCache]: Analyzing trace with hash 717919000, now seen corresponding path program 7 times [2024-06-14 15:40:42,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:42,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010327073] [2024-06-14 15:40:42,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:42,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:47,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010327073] [2024-06-14 15:40:47,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010327073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:47,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:47,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638116268] [2024-06-14 15:40:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:47,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:47,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:47,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:47,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 156 transitions, 1424 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:47,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:47,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:47,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:47,872 INFO L124 PetriNetUnfolderBase]: 443/792 cut-off events. [2024-06-14 15:40:47,872 INFO L125 PetriNetUnfolderBase]: For 43572/43572 co-relation queries the response was YES. [2024-06-14 15:40:47,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 792 events. 443/792 cut-off events. For 43572/43572 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3646 event pairs, 43 based on Foata normal form. 2/792 useless extension candidates. Maximal degree in co-relation 4578. Up to 609 conditions per place. [2024-06-14 15:40:47,879 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 125 selfloop transitions, 48 changer transitions 0/175 dead transitions. [2024-06-14 15:40:47,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 175 transitions, 1838 flow [2024-06-14 15:40:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:40:47,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:40:47,886 INFO L175 Difference]: Start difference. First operand has 184 places, 156 transitions, 1424 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:40:47,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 175 transitions, 1838 flow [2024-06-14 15:40:47,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 175 transitions, 1734 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:47,986 INFO L231 Difference]: Finished difference. Result has 186 places, 157 transitions, 1442 flow [2024-06-14 15:40:47,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1442, PETRI_PLACES=186, PETRI_TRANSITIONS=157} [2024-06-14 15:40:47,987 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 155 predicate places. [2024-06-14 15:40:47,987 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 157 transitions, 1442 flow [2024-06-14 15:40:47,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:47,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:47,987 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:40:47,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:40:47,988 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:47,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash 547211920, now seen corresponding path program 8 times [2024-06-14 15:40:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825338071] [2024-06-14 15:40:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:52,487 INFO 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:40:52,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:52,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825338071] [2024-06-14 15:40:52,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825338071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:52,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:40:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109002555] [2024-06-14 15:40:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:52,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:40:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:52,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:40:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:40:52,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:52,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 157 transitions, 1442 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40:52,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:52,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:52,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:52,915 INFO L124 PetriNetUnfolderBase]: 447/800 cut-off events. [2024-06-14 15:40:52,915 INFO L125 PetriNetUnfolderBase]: For 45001/45001 co-relation queries the response was YES. [2024-06-14 15:40:52,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 800 events. 447/800 cut-off events. For 45001/45001 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3714 event pairs, 49 based on Foata normal form. 2/800 useless extension candidates. Maximal degree in co-relation 4640. Up to 603 conditions per place. [2024-06-14 15:40:52,922 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 128 selfloop transitions, 46 changer transitions 0/176 dead transitions. [2024-06-14 15:40:52,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 176 transitions, 1858 flow [2024-06-14 15:40:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:40:52,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:40:52,923 INFO L175 Difference]: Start difference. First operand has 186 places, 157 transitions, 1442 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:40:52,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 176 transitions, 1858 flow [2024-06-14 15:40:53,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 176 transitions, 1746 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:53,004 INFO L231 Difference]: Finished difference. Result has 188 places, 158 transitions, 1450 flow [2024-06-14 15:40:53,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1450, PETRI_PLACES=188, PETRI_TRANSITIONS=158} [2024-06-14 15:40:53,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-14 15:40:53,004 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 158 transitions, 1450 flow [2024-06-14 15:40:53,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40:53,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:53,005 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:40:53,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:40:53,005 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:53,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:53,005 INFO L85 PathProgramCache]: Analyzing trace with hash 547096600, now seen corresponding path program 9 times [2024-06-14 15:40:53,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:53,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429457938] [2024-06-14 15:40:53,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429457938] [2024-06-14 15:40:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429457938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:57,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:40:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675346968] [2024-06-14 15:40:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:57,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:40:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:40:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:40:57,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:40:57,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 158 transitions, 1450 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:57,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:57,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:40:57,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:58,272 INFO L124 PetriNetUnfolderBase]: 451/808 cut-off events. [2024-06-14 15:40:58,272 INFO L125 PetriNetUnfolderBase]: For 46474/46474 co-relation queries the response was YES. [2024-06-14 15:40:58,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4786 conditions, 808 events. 451/808 cut-off events. For 46474/46474 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3761 event pairs, 53 based on Foata normal form. 2/808 useless extension candidates. Maximal degree in co-relation 4694. Up to 534 conditions per place. [2024-06-14 15:40:58,278 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 126 selfloop transitions, 50 changer transitions 0/178 dead transitions. [2024-06-14 15:40:58,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 178 transitions, 2000 flow [2024-06-14 15:40:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:40:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:40:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:40:58,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:40:58,280 INFO L175 Difference]: Start difference. First operand has 188 places, 158 transitions, 1450 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:40:58,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 178 transitions, 2000 flow [2024-06-14 15:40:58,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 178 transitions, 1890 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:58,371 INFO L231 Difference]: Finished difference. Result has 190 places, 159 transitions, 1468 flow [2024-06-14 15:40:58,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1468, PETRI_PLACES=190, PETRI_TRANSITIONS=159} [2024-06-14 15:40:58,372 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 159 predicate places. [2024-06-14 15:40:58,372 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 159 transitions, 1468 flow [2024-06-14 15:40:58,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:40:58,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:58,372 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:40:58,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:40:58,373 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:58,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 717914350, now seen corresponding path program 10 times [2024-06-14 15:40:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699413212] [2024-06-14 15:40:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:02,948 INFO 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:41:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699413212] [2024-06-14 15:41:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699413212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:41:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107633095] [2024-06-14 15:41:02,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:02,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:41:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:41:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:41:03,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:03,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 159 transitions, 1468 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:41:03,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:03,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:03,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:03,438 INFO L124 PetriNetUnfolderBase]: 455/816 cut-off events. [2024-06-14 15:41:03,438 INFO L125 PetriNetUnfolderBase]: For 48106/48106 co-relation queries the response was YES. [2024-06-14 15:41:03,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 816 events. 455/816 cut-off events. For 48106/48106 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3823 event pairs, 47 based on Foata normal form. 2/816 useless extension candidates. Maximal degree in co-relation 4764. Up to 613 conditions per place. [2024-06-14 15:41:03,445 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 126 selfloop transitions, 50 changer transitions 0/178 dead transitions. [2024-06-14 15:41:03,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 178 transitions, 1892 flow [2024-06-14 15:41:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:41:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:41:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:41:03,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:41:03,446 INFO L175 Difference]: Start difference. First operand has 190 places, 159 transitions, 1468 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:41:03,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 178 transitions, 1892 flow [2024-06-14 15:41:03,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 178 transitions, 1734 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-14 15:41:03,543 INFO L231 Difference]: Finished difference. Result has 191 places, 160 transitions, 1442 flow [2024-06-14 15:41:03,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1442, PETRI_PLACES=191, PETRI_TRANSITIONS=160} [2024-06-14 15:41:03,544 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-14 15:41:03,544 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 160 transitions, 1442 flow [2024-06-14 15:41:03,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:41:03,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:03,544 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:41:03,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:41:03,544 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:03,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1684820302, now seen corresponding path program 1 times [2024-06-14 15:41:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:03,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399435504] [2024-06-14 15:41:03,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:03,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:08,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399435504] [2024-06-14 15:41:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399435504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:08,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:08,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:41:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886059157] [2024-06-14 15:41:08,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:08,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:41:08,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:08,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:41:08,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:41:08,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:08,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 160 transitions, 1442 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:08,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:08,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:08,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:09,229 INFO L124 PetriNetUnfolderBase]: 459/824 cut-off events. [2024-06-14 15:41:09,229 INFO L125 PetriNetUnfolderBase]: For 49122/49122 co-relation queries the response was YES. [2024-06-14 15:41:09,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 824 events. 459/824 cut-off events. For 49122/49122 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3865 event pairs, 52 based on Foata normal form. 2/824 useless extension candidates. Maximal degree in co-relation 4688. Up to 494 conditions per place. [2024-06-14 15:41:09,235 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 98 selfloop transitions, 85 changer transitions 0/185 dead transitions. [2024-06-14 15:41:09,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 185 transitions, 2018 flow [2024-06-14 15:41:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:41:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:41:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-06-14 15:41:09,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35096153846153844 [2024-06-14 15:41:09,237 INFO L175 Difference]: Start difference. First operand has 191 places, 160 transitions, 1442 flow. Second operand 13 states and 146 transitions. [2024-06-14 15:41:09,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 185 transitions, 2018 flow [2024-06-14 15:41:09,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 185 transitions, 1889 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:41:09,337 INFO L231 Difference]: Finished difference. Result has 195 places, 161 transitions, 1503 flow [2024-06-14 15:41:09,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1503, PETRI_PLACES=195, PETRI_TRANSITIONS=161} [2024-06-14 15:41:09,337 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 164 predicate places. [2024-06-14 15:41:09,338 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 161 transitions, 1503 flow [2024-06-14 15:41:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:09,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:09,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:09,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:41:09,338 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:09,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1348300724, now seen corresponding path program 11 times [2024-06-14 15:41:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:09,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094208035] [2024-06-14 15:41:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:14,046 INFO 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:41:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094208035] [2024-06-14 15:41:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094208035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:14,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:14,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449943584] [2024-06-14 15:41:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:14,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:14,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:14,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 161 transitions, 1503 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:41:14,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:14,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:14,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:14,441 INFO L124 PetriNetUnfolderBase]: 463/832 cut-off events. [2024-06-14 15:41:14,442 INFO L125 PetriNetUnfolderBase]: For 50720/50720 co-relation queries the response was YES. [2024-06-14 15:41:14,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 832 events. 463/832 cut-off events. For 50720/50720 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3920 event pairs, 57 based on Foata normal form. 2/832 useless extension candidates. Maximal degree in co-relation 4804. Up to 622 conditions per place. [2024-06-14 15:41:14,448 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 131 selfloop transitions, 47 changer transitions 0/180 dead transitions. [2024-06-14 15:41:14,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 180 transitions, 2058 flow [2024-06-14 15:41:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:41:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:41:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 15:41:14,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 15:41:14,449 INFO L175 Difference]: Start difference. First operand has 195 places, 161 transitions, 1503 flow. Second operand 10 states and 114 transitions. [2024-06-14 15:41:14,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 180 transitions, 2058 flow [2024-06-14 15:41:14,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 180 transitions, 1934 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:41:14,534 INFO L231 Difference]: Finished difference. Result has 197 places, 162 transitions, 1498 flow [2024-06-14 15:41:14,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1498, PETRI_PLACES=197, PETRI_TRANSITIONS=162} [2024-06-14 15:41:14,536 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2024-06-14 15:41:14,537 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 162 transitions, 1498 flow [2024-06-14 15:41:14,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:41:14,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:14,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:41:14,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:41:14,537 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:14,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:14,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1980285766, now seen corresponding path program 12 times [2024-06-14 15:41:14,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44938752] [2024-06-14 15:41:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:19,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:19,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44938752] [2024-06-14 15:41:19,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44938752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:19,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:41:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843451145] [2024-06-14 15:41:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:19,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:41:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:41:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:41:19,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:19,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 162 transitions, 1498 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:19,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:19,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:19,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:19,933 INFO L124 PetriNetUnfolderBase]: 467/840 cut-off events. [2024-06-14 15:41:19,933 INFO L125 PetriNetUnfolderBase]: For 52550/52550 co-relation queries the response was YES. [2024-06-14 15:41:19,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4900 conditions, 840 events. 467/840 cut-off events. For 52550/52550 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3997 event pairs, 49 based on Foata normal form. 2/840 useless extension candidates. Maximal degree in co-relation 4807. Up to 657 conditions per place. [2024-06-14 15:41:19,940 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 129 selfloop transitions, 51 changer transitions 0/182 dead transitions. [2024-06-14 15:41:19,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 182 transitions, 1931 flow [2024-06-14 15:41:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:41:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:41:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 15:41:19,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:41:19,942 INFO L175 Difference]: Start difference. First operand has 197 places, 162 transitions, 1498 flow. Second operand 11 states and 121 transitions. [2024-06-14 15:41:19,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 182 transitions, 1931 flow [2024-06-14 15:41:20,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 182 transitions, 1807 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:41:20,045 INFO L231 Difference]: Finished difference. Result has 200 places, 163 transitions, 1505 flow [2024-06-14 15:41:20,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1505, PETRI_PLACES=200, PETRI_TRANSITIONS=163} [2024-06-14 15:41:20,046 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-14 15:41:20,046 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 163 transitions, 1505 flow [2024-06-14 15:41:20,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:20,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:20,046 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:41:20,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:41:20,047 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:20,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1980278822, now seen corresponding path program 1 times [2024-06-14 15:41:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:20,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966434243] [2024-06-14 15:41:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:24,522 INFO 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:41:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:24,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966434243] [2024-06-14 15:41:24,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966434243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:41:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164787867] [2024-06-14 15:41:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:24,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:41:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:24,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:41:24,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:41:24,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:24,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 163 transitions, 1505 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:41:24,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:24,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:24,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:25,011 INFO L124 PetriNetUnfolderBase]: 463/834 cut-off events. [2024-06-14 15:41:25,011 INFO L125 PetriNetUnfolderBase]: For 48966/48966 co-relation queries the response was YES. [2024-06-14 15:41:25,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 834 events. 463/834 cut-off events. For 48966/48966 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3952 event pairs, 54 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 4633. Up to 544 conditions per place. [2024-06-14 15:41:25,017 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 73 changer transitions 0/183 dead transitions. [2024-06-14 15:41:25,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 183 transitions, 1923 flow [2024-06-14 15:41:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:41:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:41:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 15:41:25,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-14 15:41:25,019 INFO L175 Difference]: Start difference. First operand has 200 places, 163 transitions, 1505 flow. Second operand 11 states and 129 transitions. [2024-06-14 15:41:25,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 183 transitions, 1923 flow [2024-06-14 15:41:25,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 183 transitions, 1797 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 15:41:25,109 INFO L231 Difference]: Finished difference. Result has 202 places, 163 transitions, 1534 flow [2024-06-14 15:41:25,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1534, PETRI_PLACES=202, PETRI_TRANSITIONS=163} [2024-06-14 15:41:25,110 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-14 15:41:25,110 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 163 transitions, 1534 flow [2024-06-14 15:41:25,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:41:25,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:25,110 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:41:25,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:41:25,110 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:25,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1684464112, now seen corresponding path program 2 times [2024-06-14 15:41:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192921797] [2024-06-14 15:41:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:30,298 INFO 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:41:30,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:30,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192921797] [2024-06-14 15:41:30,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192921797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:30,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:30,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:41:30,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127505019] [2024-06-14 15:41:30,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:30,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:41:30,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:30,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:41:30,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:41:30,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:30,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 163 transitions, 1534 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:30,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:30,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:30,935 INFO L124 PetriNetUnfolderBase]: 503/914 cut-off events. [2024-06-14 15:41:30,935 INFO L125 PetriNetUnfolderBase]: For 79778/79778 co-relation queries the response was YES. [2024-06-14 15:41:30,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 914 events. 503/914 cut-off events. For 79778/79778 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4433 event pairs, 66 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 5771. Up to 481 conditions per place. [2024-06-14 15:41:30,943 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 88 changer transitions 0/195 dead transitions. [2024-06-14 15:41:30,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 195 transitions, 2318 flow [2024-06-14 15:41:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:41:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:41:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2024-06-14 15:41:30,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629807692307692 [2024-06-14 15:41:30,945 INFO L175 Difference]: Start difference. First operand has 202 places, 163 transitions, 1534 flow. Second operand 13 states and 151 transitions. [2024-06-14 15:41:30,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 195 transitions, 2318 flow [2024-06-14 15:41:31,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 2106 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-14 15:41:31,079 INFO L231 Difference]: Finished difference. Result has 203 places, 165 transitions, 1532 flow [2024-06-14 15:41:31,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1532, PETRI_PLACES=203, PETRI_TRANSITIONS=165} [2024-06-14 15:41:31,079 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-14 15:41:31,079 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 165 transitions, 1532 flow [2024-06-14 15:41:31,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:31,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:31,080 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:41:31,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:41:31,080 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:31,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1980039502, now seen corresponding path program 3 times [2024-06-14 15:41:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127286424] [2024-06-14 15:41:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:35,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127286424] [2024-06-14 15:41:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127286424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:35,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:35,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:41:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589259271] [2024-06-14 15:41:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:35,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:41:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:35,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:41:35,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:41:36,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:36,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 165 transitions, 1532 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:36,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:36,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:36,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:36,385 INFO L124 PetriNetUnfolderBase]: 523/958 cut-off events. [2024-06-14 15:41:36,385 INFO L125 PetriNetUnfolderBase]: For 106887/106887 co-relation queries the response was YES. [2024-06-14 15:41:36,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 958 events. 523/958 cut-off events. For 106887/106887 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4740 event pairs, 78 based on Foata normal form. 12/968 useless extension candidates. Maximal degree in co-relation 5978. Up to 620 conditions per place. [2024-06-14 15:41:36,393 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 111 selfloop transitions, 70 changer transitions 9/192 dead transitions. [2024-06-14 15:41:36,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 192 transitions, 2010 flow [2024-06-14 15:41:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:41:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:41:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 15:41:36,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:41:36,402 INFO L175 Difference]: Start difference. First operand has 203 places, 165 transitions, 1532 flow. Second operand 12 states and 141 transitions. [2024-06-14 15:41:36,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 192 transitions, 2010 flow [2024-06-14 15:41:36,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 192 transitions, 1875 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:41:36,545 INFO L231 Difference]: Finished difference. Result has 206 places, 162 transitions, 1525 flow [2024-06-14 15:41:36,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1525, PETRI_PLACES=206, PETRI_TRANSITIONS=162} [2024-06-14 15:41:36,546 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-14 15:41:36,546 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 162 transitions, 1525 flow [2024-06-14 15:41:36,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:36,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:36,553 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:41:36,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:41:36,554 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:36,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1694939632, now seen corresponding path program 4 times [2024-06-14 15:41:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950189830] [2024-06-14 15:41:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:41,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950189830] [2024-06-14 15:41:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950189830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:41,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:41:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714650882] [2024-06-14 15:41:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:41,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:41:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:41,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:41:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:41:41,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:41,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 162 transitions, 1525 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:41,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:41,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:41,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:42,187 INFO L124 PetriNetUnfolderBase]: 502/929 cut-off events. [2024-06-14 15:41:42,188 INFO L125 PetriNetUnfolderBase]: For 104343/104343 co-relation queries the response was YES. [2024-06-14 15:41:42,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5718 conditions, 929 events. 502/929 cut-off events. For 104343/104343 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4610 event pairs, 77 based on Foata normal form. 14/941 useless extension candidates. Maximal degree in co-relation 5620. Up to 595 conditions per place. [2024-06-14 15:41:42,195 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 73 changer transitions 8/188 dead transitions. [2024-06-14 15:41:42,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 188 transitions, 1979 flow [2024-06-14 15:41:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:41:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:41:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 15:41:42,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:41:42,197 INFO L175 Difference]: Start difference. First operand has 206 places, 162 transitions, 1525 flow. Second operand 12 states and 141 transitions. [2024-06-14 15:41:42,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 188 transitions, 1979 flow [2024-06-14 15:41:42,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 188 transitions, 1809 flow, removed 13 selfloop flow, removed 12 redundant places. [2024-06-14 15:41:42,316 INFO L231 Difference]: Finished difference. Result has 207 places, 159 transitions, 1483 flow [2024-06-14 15:41:42,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1483, PETRI_PLACES=207, PETRI_TRANSITIONS=159} [2024-06-14 15:41:42,317 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-14 15:41:42,317 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 159 transitions, 1483 flow [2024-06-14 15:41:42,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:41:42,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:42,317 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:41:42,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:41:42,318 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:42,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1348296074, now seen corresponding path program 13 times [2024-06-14 15:41:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699432626] [2024-06-14 15:41:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:46,798 INFO 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:41:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699432626] [2024-06-14 15:41:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699432626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:46,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666680602] [2024-06-14 15:41:46,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:46,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:46,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:46,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:46,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:46,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 159 transitions, 1483 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:41:46,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:46,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:46,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:47,162 INFO L124 PetriNetUnfolderBase]: 480/887 cut-off events. [2024-06-14 15:41:47,162 INFO L125 PetriNetUnfolderBase]: For 76002/76002 co-relation queries the response was YES. [2024-06-14 15:41:47,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5603 conditions, 887 events. 480/887 cut-off events. For 76002/76002 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4373 event pairs, 75 based on Foata normal form. 2/887 useless extension candidates. Maximal degree in co-relation 5504. Up to 704 conditions per place. [2024-06-14 15:41:47,170 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 45 changer transitions 0/177 dead transitions. [2024-06-14 15:41:47,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 177 transitions, 1900 flow [2024-06-14 15:41:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:41:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:41:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:41:47,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:41:47,171 INFO L175 Difference]: Start difference. First operand has 207 places, 159 transitions, 1483 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:41:47,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 177 transitions, 1900 flow [2024-06-14 15:41:47,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 177 transitions, 1712 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-14 15:41:47,281 INFO L231 Difference]: Finished difference. Result has 203 places, 160 transitions, 1414 flow [2024-06-14 15:41:47,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1414, PETRI_PLACES=203, PETRI_TRANSITIONS=160} [2024-06-14 15:41:47,282 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-14 15:41:47,282 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 160 transitions, 1414 flow [2024-06-14 15:41:47,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:41:47,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:47,283 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:41:47,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:41:47,283 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:47,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash -591323550, now seen corresponding path program 14 times [2024-06-14 15:41:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124350844] [2024-06-14 15:41:47,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:47,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:52,004 INFO 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:41:52,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:52,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124350844] [2024-06-14 15:41:52,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124350844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:52,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:52,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:41:52,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288298234] [2024-06-14 15:41:52,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:52,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:41:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:41:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:41:52,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:52,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 160 transitions, 1414 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:41:52,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:52,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:52,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:52,466 INFO L124 PetriNetUnfolderBase]: 477/882 cut-off events. [2024-06-14 15:41:52,466 INFO L125 PetriNetUnfolderBase]: For 70597/70597 co-relation queries the response was YES. [2024-06-14 15:41:52,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5295 conditions, 882 events. 477/882 cut-off events. For 70597/70597 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4351 event pairs, 74 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 5196. Up to 699 conditions per place. [2024-06-14 15:41:52,473 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 44 changer transitions 0/178 dead transitions. [2024-06-14 15:41:52,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 178 transitions, 1814 flow [2024-06-14 15:41:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:41:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:41:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:41:52,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:41:52,474 INFO L175 Difference]: Start difference. First operand has 203 places, 160 transitions, 1414 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:41:52,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 178 transitions, 1814 flow [2024-06-14 15:41:52,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 178 transitions, 1688 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 15:41:52,594 INFO L231 Difference]: Finished difference. Result has 205 places, 160 transitions, 1380 flow [2024-06-14 15:41:52,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1380, PETRI_PLACES=205, PETRI_TRANSITIONS=160} [2024-06-14 15:41:52,594 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2024-06-14 15:41:52,594 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 160 transitions, 1380 flow [2024-06-14 15:41:52,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:41:52,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:52,595 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:41:52,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:41:52,595 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:52,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash -591077286, now seen corresponding path program 5 times [2024-06-14 15:41:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200956118] [2024-06-14 15:41:52,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:52,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200956118] [2024-06-14 15:41:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200956118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:57,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:41:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318580884] [2024-06-14 15:41:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:41:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:41:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:41:57,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:41:57,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 160 transitions, 1380 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:41:57,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:57,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:41:57,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:57,976 INFO L124 PetriNetUnfolderBase]: 474/877 cut-off events. [2024-06-14 15:41:57,977 INFO L125 PetriNetUnfolderBase]: For 66506/66506 co-relation queries the response was YES. [2024-06-14 15:41:57,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 877 events. 474/877 cut-off events. For 66506/66506 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4335 event pairs, 91 based on Foata normal form. 2/877 useless extension candidates. Maximal degree in co-relation 4972. Up to 803 conditions per place. [2024-06-14 15:41:57,983 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 30 changer transitions 0/176 dead transitions. [2024-06-14 15:41:57,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 176 transitions, 1768 flow [2024-06-14 15:41:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:41:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:41:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-14 15:41:57,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2024-06-14 15:41:57,985 INFO L175 Difference]: Start difference. First operand has 205 places, 160 transitions, 1380 flow. Second operand 11 states and 114 transitions. [2024-06-14 15:41:57,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 176 transitions, 1768 flow [2024-06-14 15:41:58,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 176 transitions, 1630 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:41:58,097 INFO L231 Difference]: Finished difference. Result has 207 places, 161 transitions, 1317 flow [2024-06-14 15:41:58,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1317, PETRI_PLACES=207, PETRI_TRANSITIONS=161} [2024-06-14 15:41:58,098 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-14 15:41:58,098 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 161 transitions, 1317 flow [2024-06-14 15:41:58,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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:41:58,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:58,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:58,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:41:58,099 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:58,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1902368654, now seen corresponding path program 1 times [2024-06-14 15:41:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800739786] [2024-06-14 15:41:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:02,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:02,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800739786] [2024-06-14 15:42:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800739786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:42:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818251479] [2024-06-14 15:42:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:02,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:42:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:42:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:42:02,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:02,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 161 transitions, 1317 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:02,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:02,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:02,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:03,048 INFO L124 PetriNetUnfolderBase]: 478/885 cut-off events. [2024-06-14 15:42:03,049 INFO L125 PetriNetUnfolderBase]: For 68037/68037 co-relation queries the response was YES. [2024-06-14 15:42:03,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 885 events. 478/885 cut-off events. For 68037/68037 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4393 event pairs, 74 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 4916. Up to 799 conditions per place. [2024-06-14 15:42:03,056 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 168 selfloop transitions, 14 changer transitions 0/184 dead transitions. [2024-06-14 15:42:03,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 184 transitions, 1737 flow [2024-06-14 15:42:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-14 15:42:03,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-14 15:42:03,057 INFO L175 Difference]: Start difference. First operand has 207 places, 161 transitions, 1317 flow. Second operand 11 states and 110 transitions. [2024-06-14 15:42:03,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 184 transitions, 1737 flow [2024-06-14 15:42:03,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 184 transitions, 1581 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-14 15:42:03,183 INFO L231 Difference]: Finished difference. Result has 208 places, 162 transitions, 1201 flow [2024-06-14 15:42:03,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1201, PETRI_PLACES=208, PETRI_TRANSITIONS=162} [2024-06-14 15:42:03,184 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2024-06-14 15:42:03,184 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 162 transitions, 1201 flow [2024-06-14 15:42:03,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:03,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:03,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:03,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:42:03,185 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:03,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash -591732692, now seen corresponding path program 2 times [2024-06-14 15:42:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42548428] [2024-06-14 15:42:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:07,948 INFO 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:42:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42548428] [2024-06-14 15:42:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42548428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:07,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:07,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:42:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116666826] [2024-06-14 15:42:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:07,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:42:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:07,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:42:07,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:42:08,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:08,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 162 transitions, 1201 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:08,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:08,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:08,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:08,382 INFO L124 PetriNetUnfolderBase]: 460/847 cut-off events. [2024-06-14 15:42:08,383 INFO L125 PetriNetUnfolderBase]: For 46524/46524 co-relation queries the response was YES. [2024-06-14 15:42:08,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4127 conditions, 847 events. 460/847 cut-off events. For 46524/46524 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4211 event pairs, 69 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 4026. Up to 694 conditions per place. [2024-06-14 15:42:08,389 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 24 changer transitions 0/187 dead transitions. [2024-06-14 15:42:08,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 187 transitions, 1793 flow [2024-06-14 15:42:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-14 15:42:08,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-14 15:42:08,391 INFO L175 Difference]: Start difference. First operand has 208 places, 162 transitions, 1201 flow. Second operand 11 states and 119 transitions. [2024-06-14 15:42:08,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 187 transitions, 1793 flow [2024-06-14 15:42:08,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 187 transitions, 1741 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:42:08,496 INFO L231 Difference]: Finished difference. Result has 209 places, 164 transitions, 1219 flow [2024-06-14 15:42:08,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1219, PETRI_PLACES=209, PETRI_TRANSITIONS=164} [2024-06-14 15:42:08,496 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-14 15:42:08,497 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 164 transitions, 1219 flow [2024-06-14 15:42:08,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:08,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:08,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:08,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:42:08,497 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:08,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1977906340, now seen corresponding path program 3 times [2024-06-14 15:42:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:08,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465544806] [2024-06-14 15:42:08,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:12,917 INFO 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:42:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465544806] [2024-06-14 15:42:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465544806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:12,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:12,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:42:12,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468900035] [2024-06-14 15:42:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:12,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:42:12,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:42:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:42:13,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:13,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 164 transitions, 1219 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:13,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:13,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:13,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:13,394 INFO L124 PetriNetUnfolderBase]: 471/868 cut-off events. [2024-06-14 15:42:13,394 INFO L125 PetriNetUnfolderBase]: For 53734/53734 co-relation queries the response was YES. [2024-06-14 15:42:13,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 868 events. 471/868 cut-off events. For 53734/53734 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4329 event pairs, 70 based on Foata normal form. 2/868 useless extension candidates. Maximal degree in co-relation 4243. Up to 763 conditions per place. [2024-06-14 15:42:13,400 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 26 changer transitions 0/189 dead transitions. [2024-06-14 15:42:13,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 189 transitions, 1821 flow [2024-06-14 15:42:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 15:42:13,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33238636363636365 [2024-06-14 15:42:13,402 INFO L175 Difference]: Start difference. First operand has 209 places, 164 transitions, 1219 flow. Second operand 11 states and 117 transitions. [2024-06-14 15:42:13,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 189 transitions, 1821 flow [2024-06-14 15:42:13,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 189 transitions, 1783 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:13,512 INFO L231 Difference]: Finished difference. Result has 213 places, 166 transitions, 1255 flow [2024-06-14 15:42:13,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1255, PETRI_PLACES=213, PETRI_TRANSITIONS=166} [2024-06-14 15:42:13,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-14 15:42:13,512 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 166 transitions, 1255 flow [2024-06-14 15:42:13,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:13,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:13,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:13,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:42:13,513 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:13,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1977762190, now seen corresponding path program 4 times [2024-06-14 15:42:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140661631] [2024-06-14 15:42:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:18,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:18,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140661631] [2024-06-14 15:42:18,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140661631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:18,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:18,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:42:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67117057] [2024-06-14 15:42:18,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:18,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:42:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:18,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:42:18,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:42:18,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:18,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 166 transitions, 1255 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:18,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:18,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:18,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:18,718 INFO L124 PetriNetUnfolderBase]: 468/863 cut-off events. [2024-06-14 15:42:18,718 INFO L125 PetriNetUnfolderBase]: For 49098/49098 co-relation queries the response was YES. [2024-06-14 15:42:18,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 863 events. 468/863 cut-off events. For 49098/49098 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4310 event pairs, 67 based on Foata normal form. 2/863 useless extension candidates. Maximal degree in co-relation 4122. Up to 734 conditions per place. [2024-06-14 15:42:18,724 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 26 changer transitions 0/189 dead transitions. [2024-06-14 15:42:18,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 189 transitions, 1841 flow [2024-06-14 15:42:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 15:42:18,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-14 15:42:18,726 INFO L175 Difference]: Start difference. First operand has 213 places, 166 transitions, 1255 flow. Second operand 11 states and 118 transitions. [2024-06-14 15:42:18,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 189 transitions, 1841 flow [2024-06-14 15:42:18,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 189 transitions, 1807 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:18,833 INFO L231 Difference]: Finished difference. Result has 217 places, 166 transitions, 1277 flow [2024-06-14 15:42:18,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1277, PETRI_PLACES=217, PETRI_TRANSITIONS=166} [2024-06-14 15:42:18,834 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-14 15:42:18,834 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 166 transitions, 1277 flow [2024-06-14 15:42:18,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:18,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:18,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:18,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:42:18,835 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:18,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash -588008042, now seen corresponding path program 5 times [2024-06-14 15:42:18,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:18,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572415822] [2024-06-14 15:42:18,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:23,056 INFO 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:42:23,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:23,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572415822] [2024-06-14 15:42:23,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572415822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:23,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:23,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:42:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233617136] [2024-06-14 15:42:23,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:23,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:42:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:23,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:42:23,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:42:23,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:23,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 166 transitions, 1277 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:23,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:23,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:23,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:23,505 INFO L124 PetriNetUnfolderBase]: 465/858 cut-off events. [2024-06-14 15:42:23,506 INFO L125 PetriNetUnfolderBase]: For 44208/44208 co-relation queries the response was YES. [2024-06-14 15:42:23,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4112 conditions, 858 events. 465/858 cut-off events. For 44208/44208 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4276 event pairs, 70 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4007. Up to 772 conditions per place. [2024-06-14 15:42:23,513 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 26 changer transitions 0/188 dead transitions. [2024-06-14 15:42:23,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 188 transitions, 1707 flow [2024-06-14 15:42:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 15:42:23,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-14 15:42:23,514 INFO L175 Difference]: Start difference. First operand has 217 places, 166 transitions, 1277 flow. Second operand 11 states and 115 transitions. [2024-06-14 15:42:23,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 188 transitions, 1707 flow [2024-06-14 15:42:23,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 188 transitions, 1627 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 15:42:23,618 INFO L231 Difference]: Finished difference. Result has 217 places, 166 transitions, 1254 flow [2024-06-14 15:42:23,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1254, PETRI_PLACES=217, PETRI_TRANSITIONS=166} [2024-06-14 15:42:23,620 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-14 15:42:23,620 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 166 transitions, 1254 flow [2024-06-14 15:42:23,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:23,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:23,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:23,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:42:23,621 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:23,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1262543020, now seen corresponding path program 1 times [2024-06-14 15:42:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:23,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64221609] [2024-06-14 15:42:23,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42: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:42:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64221609] [2024-06-14 15:42:28,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64221609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:28,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:28,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:42:28,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410721952] [2024-06-14 15:42:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:28,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:42:28,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:42:28,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:42:28,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:28,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 166 transitions, 1254 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:28,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:28,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:28,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:28,952 INFO L124 PetriNetUnfolderBase]: 481/894 cut-off events. [2024-06-14 15:42:28,952 INFO L125 PetriNetUnfolderBase]: For 70722/70722 co-relation queries the response was YES. [2024-06-14 15:42:28,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4169 conditions, 894 events. 481/894 cut-off events. For 70722/70722 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4504 event pairs, 58 based on Foata normal form. 10/902 useless extension candidates. Maximal degree in co-relation 4064. Up to 533 conditions per place. [2024-06-14 15:42:28,959 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 106 selfloop transitions, 69 changer transitions 13/190 dead transitions. [2024-06-14 15:42:28,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 190 transitions, 1706 flow [2024-06-14 15:42:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:42:28,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:42:28,961 INFO L175 Difference]: Start difference. First operand has 217 places, 166 transitions, 1254 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:42:28,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 190 transitions, 1706 flow [2024-06-14 15:42:29,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 190 transitions, 1651 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:42:29,090 INFO L231 Difference]: Finished difference. Result has 218 places, 158 transitions, 1280 flow [2024-06-14 15:42:29,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1280, PETRI_PLACES=218, PETRI_TRANSITIONS=158} [2024-06-14 15:42:29,091 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2024-06-14 15:42:29,091 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 158 transitions, 1280 flow [2024-06-14 15:42:29,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:29,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:29,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:29,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:42:29,092 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:29,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash 987589594, now seen corresponding path program 2 times [2024-06-14 15:42:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:29,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798801520] [2024-06-14 15:42:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:29,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:34,194 INFO 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:42:34,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:34,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798801520] [2024-06-14 15:42:34,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798801520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:34,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:34,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:42:34,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658037333] [2024-06-14 15:42:34,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:34,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:42:34,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:34,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:42:34,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:42:34,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:34,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 158 transitions, 1280 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:34,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:34,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:34,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:34,697 INFO L124 PetriNetUnfolderBase]: 485/926 cut-off events. [2024-06-14 15:42:34,697 INFO L125 PetriNetUnfolderBase]: For 105153/105153 co-relation queries the response was YES. [2024-06-14 15:42:34,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 926 events. 485/926 cut-off events. For 105153/105153 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4748 event pairs, 74 based on Foata normal form. 8/932 useless extension candidates. Maximal degree in co-relation 5201. Up to 449 conditions per place. [2024-06-14 15:42:34,705 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 105 selfloop transitions, 74 changer transitions 6/187 dead transitions. [2024-06-14 15:42:34,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 187 transitions, 1912 flow [2024-06-14 15:42:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:42:34,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:42:34,707 INFO L175 Difference]: Start difference. First operand has 218 places, 158 transitions, 1280 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:42:34,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 187 transitions, 1912 flow [2024-06-14 15:42:34,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 187 transitions, 1759 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-14 15:42:34,900 INFO L231 Difference]: Finished difference. Result has 216 places, 157 transitions, 1275 flow [2024-06-14 15:42:34,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1275, PETRI_PLACES=216, PETRI_TRANSITIONS=157} [2024-06-14 15:42:34,901 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-14 15:42:34,901 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 157 transitions, 1275 flow [2024-06-14 15:42:34,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:34,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:34,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:34,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:42:34,902 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:34,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash 987580294, now seen corresponding path program 3 times [2024-06-14 15:42:34,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:34,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184650950] [2024-06-14 15:42:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:39,913 INFO 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:42:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184650950] [2024-06-14 15:42:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184650950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:39,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:39,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:42:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476139861] [2024-06-14 15:42:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:39,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:42:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:42:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:42:40,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:40,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 157 transitions, 1275 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:40,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:40,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:40,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:40,398 INFO L124 PetriNetUnfolderBase]: 475/912 cut-off events. [2024-06-14 15:42:40,398 INFO L125 PetriNetUnfolderBase]: For 105327/105327 co-relation queries the response was YES. [2024-06-14 15:42:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4930 conditions, 912 events. 475/912 cut-off events. For 105327/105327 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4708 event pairs, 78 based on Foata normal form. 12/922 useless extension candidates. Maximal degree in co-relation 4825. Up to 529 conditions per place. [2024-06-14 15:42:40,406 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 100 selfloop transitions, 73 changer transitions 7/182 dead transitions. [2024-06-14 15:42:40,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 182 transitions, 1719 flow [2024-06-14 15:42:40,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:42:40,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:42:40,408 INFO L175 Difference]: Start difference. First operand has 216 places, 157 transitions, 1275 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:42:40,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 182 transitions, 1719 flow [2024-06-14 15:42:40,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 182 transitions, 1569 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:42:40,564 INFO L231 Difference]: Finished difference. Result has 216 places, 155 transitions, 1266 flow [2024-06-14 15:42:40,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1266, PETRI_PLACES=216, PETRI_TRANSITIONS=155} [2024-06-14 15:42:40,565 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-14 15:42:40,565 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 155 transitions, 1266 flow [2024-06-14 15:42:40,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:40,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:40,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:40,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:42:40,566 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:40,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash 979961238, now seen corresponding path program 6 times [2024-06-14 15:42:40,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:40,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125009795] [2024-06-14 15:42:40,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:45,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125009795] [2024-06-14 15:42:45,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125009795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:45,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:45,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:42:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709024977] [2024-06-14 15:42:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:45,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:42:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:45,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:42:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:42:45,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:45,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 155 transitions, 1266 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:45,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:45,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:45,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:45,515 INFO L124 PetriNetUnfolderBase]: 433/826 cut-off events. [2024-06-14 15:42:45,515 INFO L125 PetriNetUnfolderBase]: For 46396/46396 co-relation queries the response was YES. [2024-06-14 15:42:45,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4052 conditions, 826 events. 433/826 cut-off events. For 46396/46396 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4212 event pairs, 62 based on Foata normal form. 2/826 useless extension candidates. Maximal degree in co-relation 3947. Up to 491 conditions per place. [2024-06-14 15:42:45,523 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 69 changer transitions 0/176 dead transitions. [2024-06-14 15:42:45,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 176 transitions, 1678 flow [2024-06-14 15:42:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-14 15:42:45,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2024-06-14 15:42:45,525 INFO L175 Difference]: Start difference. First operand has 216 places, 155 transitions, 1266 flow. Second operand 11 states and 125 transitions. [2024-06-14 15:42:45,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 176 transitions, 1678 flow [2024-06-14 15:42:45,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 176 transitions, 1514 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:42:45,663 INFO L231 Difference]: Finished difference. Result has 217 places, 156 transitions, 1256 flow [2024-06-14 15:42:45,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1256, PETRI_PLACES=217, PETRI_TRANSITIONS=156} [2024-06-14 15:42:45,664 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-14 15:42:45,664 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 156 transitions, 1256 flow [2024-06-14 15:42:45,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:45,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:45,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:45,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:42:45,665 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:45,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:45,665 INFO L85 PathProgramCache]: Analyzing trace with hash 979955658, now seen corresponding path program 7 times [2024-06-14 15:42:45,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:45,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793778026] [2024-06-14 15:42:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:50,351 INFO 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:42:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793778026] [2024-06-14 15:42:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793778026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:50,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:50,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:42:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173311929] [2024-06-14 15:42:50,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:50,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:42:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:42:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:42:50,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:50,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 156 transitions, 1256 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:50,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:50,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:50,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:50,820 INFO L124 PetriNetUnfolderBase]: 437/834 cut-off events. [2024-06-14 15:42:50,820 INFO L125 PetriNetUnfolderBase]: For 47692/47692 co-relation queries the response was YES. [2024-06-14 15:42:50,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 834 events. 437/834 cut-off events. For 47692/47692 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4264 event pairs, 60 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 3957. Up to 479 conditions per place. [2024-06-14 15:42:50,827 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 104 selfloop transitions, 71 changer transitions 0/177 dead transitions. [2024-06-14 15:42:50,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 177 transitions, 1670 flow [2024-06-14 15:42:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 15:42:50,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 15:42:50,829 INFO L175 Difference]: Start difference. First operand has 217 places, 156 transitions, 1256 flow. Second operand 11 states and 126 transitions. [2024-06-14 15:42:50,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 177 transitions, 1670 flow [2024-06-14 15:42:50,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 177 transitions, 1526 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:42:50,953 INFO L231 Difference]: Finished difference. Result has 219 places, 157 transitions, 1272 flow [2024-06-14 15:42:50,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1272, PETRI_PLACES=219, PETRI_TRANSITIONS=157} [2024-06-14 15:42:50,953 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-14 15:42:50,953 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 157 transitions, 1272 flow [2024-06-14 15:42:50,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:42:50,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:50,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:50,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:42:50,954 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:50,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash 780659448, now seen corresponding path program 8 times [2024-06-14 15:42:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:50,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814212774] [2024-06-14 15:42:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:55,752 INFO 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:42:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814212774] [2024-06-14 15:42:55,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814212774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:55,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:55,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:42:55,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323409308] [2024-06-14 15:42:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:55,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:42:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:55,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:42:55,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:42:55,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:42:55,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 157 transitions, 1272 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:55,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:55,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:42:55,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:56,311 INFO L124 PetriNetUnfolderBase]: 441/842 cut-off events. [2024-06-14 15:42:56,312 INFO L125 PetriNetUnfolderBase]: For 48897/48897 co-relation queries the response was YES. [2024-06-14 15:42:56,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 842 events. 441/842 cut-off events. For 48897/48897 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4321 event pairs, 62 based on Foata normal form. 2/842 useless extension candidates. Maximal degree in co-relation 4013. Up to 561 conditions per place. [2024-06-14 15:42:56,318 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 59 changer transitions 0/178 dead transitions. [2024-06-14 15:42:56,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 178 transitions, 1692 flow [2024-06-14 15:42:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:42:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:42:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 15:42:56,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-14 15:42:56,319 INFO L175 Difference]: Start difference. First operand has 219 places, 157 transitions, 1272 flow. Second operand 11 states and 123 transitions. [2024-06-14 15:42:56,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 178 transitions, 1692 flow [2024-06-14 15:42:56,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 178 transitions, 1542 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:42:56,462 INFO L231 Difference]: Finished difference. Result has 221 places, 158 transitions, 1260 flow [2024-06-14 15:42:56,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=221, PETRI_TRANSITIONS=158} [2024-06-14 15:42:56,463 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-14 15:42:56,463 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 158 transitions, 1260 flow [2024-06-14 15:42:56,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:56,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:56,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:56,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:42:56,463 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:56,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 780653868, now seen corresponding path program 9 times [2024-06-14 15:42:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547419591] [2024-06-14 15:42:56,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:56,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:01,097 INFO 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:43:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547419591] [2024-06-14 15:43:01,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547419591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:01,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:01,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:43:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871202180] [2024-06-14 15:43:01,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:01,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:43:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:01,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:43:01,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:43:01,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:01,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 158 transitions, 1260 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:01,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:01,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:01,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:01,628 INFO L124 PetriNetUnfolderBase]: 445/850 cut-off events. [2024-06-14 15:43:01,629 INFO L125 PetriNetUnfolderBase]: For 50038/50038 co-relation queries the response was YES. [2024-06-14 15:43:01,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 850 events. 445/850 cut-off events. For 50038/50038 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4368 event pairs, 68 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 4027. Up to 555 conditions per place. [2024-06-14 15:43:01,636 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 60 changer transitions 0/179 dead transitions. [2024-06-14 15:43:01,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 179 transitions, 1682 flow [2024-06-14 15:43:01,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:43:01,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:43:01,637 INFO L175 Difference]: Start difference. First operand has 221 places, 158 transitions, 1260 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:43:01,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 179 transitions, 1682 flow [2024-06-14 15:43:01,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 179 transitions, 1554 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:01,786 INFO L231 Difference]: Finished difference. Result has 223 places, 159 transitions, 1274 flow [2024-06-14 15:43:01,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1274, PETRI_PLACES=223, PETRI_TRANSITIONS=159} [2024-06-14 15:43:01,787 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2024-06-14 15:43:01,787 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 159 transitions, 1274 flow [2024-06-14 15:43:01,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:01,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:01,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:01,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:43:01,788 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:01,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash 780509718, now seen corresponding path program 10 times [2024-06-14 15:43:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856082176] [2024-06-14 15:43:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:01,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:06,521 INFO 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:43:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856082176] [2024-06-14 15:43:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856082176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:06,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:43:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530813486] [2024-06-14 15:43:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:06,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:43:06,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:43:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:43:06,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:06,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 159 transitions, 1274 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:43:06,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:06,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:06,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:06,975 INFO L124 PetriNetUnfolderBase]: 449/858 cut-off events. [2024-06-14 15:43:06,976 INFO L125 PetriNetUnfolderBase]: For 51407/51407 co-relation queries the response was YES. [2024-06-14 15:43:06,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4188 conditions, 858 events. 449/858 cut-off events. For 51407/51407 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4436 event pairs, 66 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4079. Up to 461 conditions per place. [2024-06-14 15:43:06,982 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 107 selfloop transitions, 71 changer transitions 0/180 dead transitions. [2024-06-14 15:43:06,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 180 transitions, 1698 flow [2024-06-14 15:43:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 15:43:06,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 15:43:06,983 INFO L175 Difference]: Start difference. First operand has 223 places, 159 transitions, 1274 flow. Second operand 11 states and 126 transitions. [2024-06-14 15:43:06,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 180 transitions, 1698 flow [2024-06-14 15:43:07,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 180 transitions, 1566 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:07,132 INFO L231 Difference]: Finished difference. Result has 225 places, 160 transitions, 1308 flow [2024-06-14 15:43:07,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1308, PETRI_PLACES=225, PETRI_TRANSITIONS=160} [2024-06-14 15:43:07,133 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-14 15:43:07,133 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 160 transitions, 1308 flow [2024-06-14 15:43:07,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:43:07,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:07,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:07,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:43:07,134 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:07,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash -216148586, now seen corresponding path program 11 times [2024-06-14 15:43:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768386388] [2024-06-14 15:43:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:12,233 INFO 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:43:12,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:12,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768386388] [2024-06-14 15:43:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768386388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:12,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:12,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:43:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628861301] [2024-06-14 15:43:12,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:12,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:43:12,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:12,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:43:12,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:43:12,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:12,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 160 transitions, 1308 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:12,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:12,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:12,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:12,839 INFO L124 PetriNetUnfolderBase]: 453/866 cut-off events. [2024-06-14 15:43:12,839 INFO L125 PetriNetUnfolderBase]: For 52732/52732 co-relation queries the response was YES. [2024-06-14 15:43:12,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4271 conditions, 866 events. 453/866 cut-off events. For 52732/52732 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4486 event pairs, 82 based on Foata normal form. 2/866 useless extension candidates. Maximal degree in co-relation 4161. Up to 585 conditions per place. [2024-06-14 15:43:12,846 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 58 changer transitions 0/181 dead transitions. [2024-06-14 15:43:12,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 181 transitions, 1740 flow [2024-06-14 15:43:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 15:43:12,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:43:12,848 INFO L175 Difference]: Start difference. First operand has 225 places, 160 transitions, 1308 flow. Second operand 11 states and 121 transitions. [2024-06-14 15:43:12,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 181 transitions, 1740 flow [2024-06-14 15:43:12,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 181 transitions, 1584 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:12,996 INFO L231 Difference]: Finished difference. Result has 227 places, 161 transitions, 1294 flow [2024-06-14 15:43:12,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=227, PETRI_TRANSITIONS=161} [2024-06-14 15:43:12,996 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-14 15:43:12,997 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 161 transitions, 1294 flow [2024-06-14 15:43:12,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:12,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:12,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:12,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:43:12,997 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:12,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1750329930, now seen corresponding path program 12 times [2024-06-14 15:43:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524261578] [2024-06-14 15:43:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:17,656 INFO 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:43:17,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524261578] [2024-06-14 15:43:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524261578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:17,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:17,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:43:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529282136] [2024-06-14 15:43:17,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:17,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:43:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:17,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:43:17,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:43:17,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:17,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 161 transitions, 1294 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:43:17,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:17,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:17,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:18,181 INFO L124 PetriNetUnfolderBase]: 457/874 cut-off events. [2024-06-14 15:43:18,182 INFO L125 PetriNetUnfolderBase]: For 53954/53954 co-relation queries the response was YES. [2024-06-14 15:43:18,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 874 events. 457/874 cut-off events. For 53954/53954 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4564 event pairs, 76 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 4173. Up to 525 conditions per place. [2024-06-14 15:43:18,188 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 72 changer transitions 0/182 dead transitions. [2024-06-14 15:43:18,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 182 transitions, 1728 flow [2024-06-14 15:43:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:43:18,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:43:18,189 INFO L175 Difference]: Start difference. First operand has 227 places, 161 transitions, 1294 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:43:18,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 182 transitions, 1728 flow [2024-06-14 15:43:18,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 182 transitions, 1628 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:43:18,339 INFO L231 Difference]: Finished difference. Result has 230 places, 162 transitions, 1366 flow [2024-06-14 15:43:18,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1366, PETRI_PLACES=230, PETRI_TRANSITIONS=162} [2024-06-14 15:43:18,339 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2024-06-14 15:43:18,339 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 162 transitions, 1366 flow [2024-06-14 15:43:18,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:43:18,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:18,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:18,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:43:18,340 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:18,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1750185780, now seen corresponding path program 13 times [2024-06-14 15:43:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502083677] [2024-06-14 15:43:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:23,135 INFO 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:43:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502083677] [2024-06-14 15:43:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502083677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:43:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521595562] [2024-06-14 15:43:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:23,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:43:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:23,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:43:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:43:23,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:23,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 162 transitions, 1366 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:23,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:23,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:23,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:23,720 INFO L124 PetriNetUnfolderBase]: 461/882 cut-off events. [2024-06-14 15:43:23,720 INFO L125 PetriNetUnfolderBase]: For 55446/55446 co-relation queries the response was YES. [2024-06-14 15:43:23,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4393 conditions, 882 events. 461/882 cut-off events. For 55446/55446 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4621 event pairs, 76 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 4281. Up to 565 conditions per place. [2024-06-14 15:43:23,728 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 60 changer transitions 0/183 dead transitions. [2024-06-14 15:43:23,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 183 transitions, 1802 flow [2024-06-14 15:43:23,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 15:43:23,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-14 15:43:23,729 INFO L175 Difference]: Start difference. First operand has 230 places, 162 transitions, 1366 flow. Second operand 11 states and 123 transitions. [2024-06-14 15:43:23,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 183 transitions, 1802 flow [2024-06-14 15:43:23,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 183 transitions, 1640 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:23,885 INFO L231 Difference]: Finished difference. Result has 232 places, 163 transitions, 1354 flow [2024-06-14 15:43:23,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1354, PETRI_PLACES=232, PETRI_TRANSITIONS=163} [2024-06-14 15:43:23,885 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-14 15:43:23,885 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 163 transitions, 1354 flow [2024-06-14 15:43:23,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:23,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:23,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:23,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:43:23,886 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:23,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1746610860, now seen corresponding path program 14 times [2024-06-14 15:43:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:23,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702344481] [2024-06-14 15:43:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:28,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:28,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702344481] [2024-06-14 15:43:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702344481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:28,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:43:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205336961] [2024-06-14 15:43:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:28,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:43:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:43:28,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:43:29,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:29,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 163 transitions, 1354 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:29,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:29,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:29,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:29,328 INFO L124 PetriNetUnfolderBase]: 465/890 cut-off events. [2024-06-14 15:43:29,328 INFO L125 PetriNetUnfolderBase]: For 56901/56901 co-relation queries the response was YES. [2024-06-14 15:43:29,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4414 conditions, 890 events. 465/890 cut-off events. For 56901/56901 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4664 event pairs, 80 based on Foata normal form. 2/890 useless extension candidates. Maximal degree in co-relation 4301. Up to 398 conditions per place. [2024-06-14 15:43:29,336 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 68 changer transitions 0/185 dead transitions. [2024-06-14 15:43:29,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 185 transitions, 1974 flow [2024-06-14 15:43:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 15:43:29,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-14 15:43:29,338 INFO L175 Difference]: Start difference. First operand has 232 places, 163 transitions, 1354 flow. Second operand 11 states and 123 transitions. [2024-06-14 15:43:29,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 185 transitions, 1974 flow [2024-06-14 15:43:29,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 185 transitions, 1834 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:29,494 INFO L231 Difference]: Finished difference. Result has 234 places, 164 transitions, 1380 flow [2024-06-14 15:43:29,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1380, PETRI_PLACES=234, PETRI_TRANSITIONS=164} [2024-06-14 15:43:29,495 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-14 15:43:29,495 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 164 transitions, 1380 flow [2024-06-14 15:43:29,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:29,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:29,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:29,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:43:29,496 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:29,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1152501594, now seen corresponding path program 15 times [2024-06-14 15:43:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:29,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169960314] [2024-06-14 15:43:29,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:34,404 INFO 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:43:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:34,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169960314] [2024-06-14 15:43:34,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169960314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:34,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:43:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734950155] [2024-06-14 15:43:34,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:34,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:43:34,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:34,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:43:34,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:43:34,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:34,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 164 transitions, 1380 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:34,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:34,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:34,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:35,054 INFO L124 PetriNetUnfolderBase]: 469/898 cut-off events. [2024-06-14 15:43:35,054 INFO L125 PetriNetUnfolderBase]: For 58272/58272 co-relation queries the response was YES. [2024-06-14 15:43:35,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 898 events. 469/898 cut-off events. For 58272/58272 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4721 event pairs, 84 based on Foata normal form. 2/898 useless extension candidates. Maximal degree in co-relation 4379. Up to 617 conditions per place. [2024-06-14 15:43:35,062 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 58 changer transitions 0/184 dead transitions. [2024-06-14 15:43:35,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 184 transitions, 1822 flow [2024-06-14 15:43:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:43:35,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:43:35,063 INFO L175 Difference]: Start difference. First operand has 234 places, 164 transitions, 1380 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:43:35,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 184 transitions, 1822 flow [2024-06-14 15:43:35,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 184 transitions, 1679 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:35,219 INFO L231 Difference]: Finished difference. Result has 236 places, 165 transitions, 1387 flow [2024-06-14 15:43:35,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1387, PETRI_PLACES=236, PETRI_TRANSITIONS=165} [2024-06-14 15:43:35,219 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-14 15:43:35,220 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 165 transitions, 1387 flow [2024-06-14 15:43:35,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:35,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:35,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:35,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:43:35,220 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:35,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1152496014, now seen corresponding path program 16 times [2024-06-14 15:43:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989465522] [2024-06-14 15:43:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:40,281 INFO 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:43:40,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:40,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989465522] [2024-06-14 15:43:40,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989465522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:40,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:40,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:43:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521808437] [2024-06-14 15:43:40,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:40,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:43:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:43:40,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:43:40,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:40,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 165 transitions, 1387 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:40,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:40,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:40,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:40,915 INFO L124 PetriNetUnfolderBase]: 473/906 cut-off events. [2024-06-14 15:43:40,915 INFO L125 PetriNetUnfolderBase]: For 59328/59328 co-relation queries the response was YES. [2024-06-14 15:43:40,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 906 events. 473/906 cut-off events. For 59328/59328 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4798 event pairs, 84 based on Foata normal form. 2/906 useless extension candidates. Maximal degree in co-relation 4366. Up to 611 conditions per place. [2024-06-14 15:43:40,922 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 59 changer transitions 0/185 dead transitions. [2024-06-14 15:43:40,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 185 transitions, 1826 flow [2024-06-14 15:43:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-14 15:43:40,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2024-06-14 15:43:40,924 INFO L175 Difference]: Start difference. First operand has 236 places, 165 transitions, 1387 flow. Second operand 11 states and 125 transitions. [2024-06-14 15:43:40,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 185 transitions, 1826 flow [2024-06-14 15:43:41,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 185 transitions, 1676 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:41,091 INFO L231 Difference]: Finished difference. Result has 238 places, 166 transitions, 1386 flow [2024-06-14 15:43:41,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1386, PETRI_PLACES=238, PETRI_TRANSITIONS=166} [2024-06-14 15:43:41,092 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-14 15:43:41,092 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 166 transitions, 1386 flow [2024-06-14 15:43:41,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:41,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:41,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:41,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:43:41,093 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:41,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1152351864, now seen corresponding path program 17 times [2024-06-14 15:43:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:41,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244501124] [2024-06-14 15:43:41,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:46,271 INFO 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:43:46,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244501124] [2024-06-14 15:43:46,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244501124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:46,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:46,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:43:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273094456] [2024-06-14 15:43:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:46,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:43:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:46,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:43:46,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:43:46,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:46,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 166 transitions, 1386 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:46,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:46,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:46,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:46,845 INFO L124 PetriNetUnfolderBase]: 477/914 cut-off events. [2024-06-14 15:43:46,846 INFO L125 PetriNetUnfolderBase]: For 60774/60774 co-relation queries the response was YES. [2024-06-14 15:43:46,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 914 events. 477/914 cut-off events. For 60774/60774 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4838 event pairs, 86 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 4404. Up to 554 conditions per place. [2024-06-14 15:43:46,854 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 123 selfloop transitions, 62 changer transitions 0/187 dead transitions. [2024-06-14 15:43:46,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 187 transitions, 2015 flow [2024-06-14 15:43:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 15:43:46,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 15:43:46,856 INFO L175 Difference]: Start difference. First operand has 238 places, 166 transitions, 1386 flow. Second operand 11 states and 126 transitions. [2024-06-14 15:43:46,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 187 transitions, 2015 flow [2024-06-14 15:43:47,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 187 transitions, 1877 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:47,027 INFO L231 Difference]: Finished difference. Result has 240 places, 167 transitions, 1403 flow [2024-06-14 15:43:47,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1403, PETRI_PLACES=240, PETRI_TRANSITIONS=167} [2024-06-14 15:43:47,028 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 209 predicate places. [2024-06-14 15:43:47,028 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 167 transitions, 1403 flow [2024-06-14 15:43:47,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:47,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:47,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:47,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:43:47,029 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:47,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash -212054454, now seen corresponding path program 4 times [2024-06-14 15:43:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:47,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666016378] [2024-06-14 15:43:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:51,833 INFO 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:43:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666016378] [2024-06-14 15:43:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666016378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:43:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955693187] [2024-06-14 15:43:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:51,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:43:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:51,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:43:51,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:43:51,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:51,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 167 transitions, 1403 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:43:51,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:51,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:51,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:52,387 INFO L124 PetriNetUnfolderBase]: 493/950 cut-off events. [2024-06-14 15:43:52,388 INFO L125 PetriNetUnfolderBase]: For 96370/96370 co-relation queries the response was YES. [2024-06-14 15:43:52,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 950 events. 493/950 cut-off events. For 96370/96370 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5044 event pairs, 94 based on Foata normal form. 10/958 useless extension candidates. Maximal degree in co-relation 4490. Up to 608 conditions per place. [2024-06-14 15:43:52,398 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 125 selfloop transitions, 54 changer transitions 10/191 dead transitions. [2024-06-14 15:43:52,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 191 transitions, 1855 flow [2024-06-14 15:43:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 15:43:52,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-14 15:43:52,399 INFO L175 Difference]: Start difference. First operand has 240 places, 167 transitions, 1403 flow. Second operand 11 states and 130 transitions. [2024-06-14 15:43:52,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 191 transitions, 1855 flow [2024-06-14 15:43:52,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 191 transitions, 1689 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:52,569 INFO L231 Difference]: Finished difference. Result has 242 places, 162 transitions, 1311 flow [2024-06-14 15:43:52,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1311, PETRI_PLACES=242, PETRI_TRANSITIONS=162} [2024-06-14 15:43:52,570 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-14 15:43:52,570 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 162 transitions, 1311 flow [2024-06-14 15:43:52,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:43:52,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:52,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:52,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:43:52,571 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:52,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash 540051950, now seen corresponding path program 18 times [2024-06-14 15:43:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157443558] [2024-06-14 15:43:52,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:52,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:57,294 INFO 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:43:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157443558] [2024-06-14 15:43:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157443558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:57,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:57,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:43:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546408206] [2024-06-14 15:43:57,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:57,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:43:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:43:57,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:43:57,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:43:57,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 162 transitions, 1311 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:57,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:57,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:43:57,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:57,834 INFO L124 PetriNetUnfolderBase]: 479/936 cut-off events. [2024-06-14 15:43:57,835 INFO L125 PetriNetUnfolderBase]: For 107136/107136 co-relation queries the response was YES. [2024-06-14 15:43:57,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 936 events. 479/936 cut-off events. For 107136/107136 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5046 event pairs, 82 based on Foata normal form. 12/946 useless extension candidates. Maximal degree in co-relation 4376. Up to 575 conditions per place. [2024-06-14 15:43:57,842 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 115 selfloop transitions, 65 changer transitions 7/189 dead transitions. [2024-06-14 15:43:57,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 189 transitions, 1792 flow [2024-06-14 15:43:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:43:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:43:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-14 15:43:57,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:43:57,844 INFO L175 Difference]: Start difference. First operand has 242 places, 162 transitions, 1311 flow. Second operand 12 states and 144 transitions. [2024-06-14 15:43:57,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 189 transitions, 1792 flow [2024-06-14 15:43:58,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 189 transitions, 1674 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-06-14 15:43:58,030 INFO L231 Difference]: Finished difference. Result has 241 places, 160 transitions, 1338 flow [2024-06-14 15:43:58,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1338, PETRI_PLACES=241, PETRI_TRANSITIONS=160} [2024-06-14 15:43:58,030 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-14 15:43:58,031 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 160 transitions, 1338 flow [2024-06-14 15:43:58,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:58,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:58,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:58,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:43:58,031 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:58,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash 540328656, now seen corresponding path program 5 times [2024-06-14 15:43:58,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:58,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455400524] [2024-06-14 15:43:58,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:03,022 INFO 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:44:03,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455400524] [2024-06-14 15:44:03,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455400524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:03,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:03,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988488415] [2024-06-14 15:44:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:03,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:03,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:03,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 160 transitions, 1338 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:03,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:03,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:03,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:03,687 INFO L124 PetriNetUnfolderBase]: 489/962 cut-off events. [2024-06-14 15:44:03,687 INFO L125 PetriNetUnfolderBase]: For 124126/124126 co-relation queries the response was YES. [2024-06-14 15:44:03,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5392 conditions, 962 events. 489/962 cut-off events. For 124126/124126 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5182 event pairs, 90 based on Foata normal form. 8/968 useless extension candidates. Maximal degree in co-relation 5276. Up to 559 conditions per place. [2024-06-14 15:44:03,694 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 62 changer transitions 8/189 dead transitions. [2024-06-14 15:44:03,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 189 transitions, 2011 flow [2024-06-14 15:44:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:44:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:44:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2024-06-14 15:44:03,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2024-06-14 15:44:03,696 INFO L175 Difference]: Start difference. First operand has 241 places, 160 transitions, 1338 flow. Second operand 12 states and 145 transitions. [2024-06-14 15:44:03,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 189 transitions, 2011 flow [2024-06-14 15:44:03,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 189 transitions, 1854 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-14 15:44:03,975 INFO L231 Difference]: Finished difference. Result has 242 places, 157 transitions, 1289 flow [2024-06-14 15:44:03,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1289, PETRI_PLACES=242, PETRI_TRANSITIONS=157} [2024-06-14 15:44:03,976 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-14 15:44:03,976 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 157 transitions, 1289 flow [2024-06-14 15:44:03,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:03,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:03,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:03,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:44:03,977 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:03,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:03,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1259309674, now seen corresponding path program 19 times [2024-06-14 15:44:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:03,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577666693] [2024-06-14 15:44:03,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:08,926 INFO 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:44:08,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:08,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577666693] [2024-06-14 15:44:08,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577666693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:08,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:08,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:44:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932070664] [2024-06-14 15:44:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:08,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:44:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:08,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:44:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:44:09,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:09,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 157 transitions, 1289 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:09,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:09,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:09,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:09,536 INFO L124 PetriNetUnfolderBase]: 467/916 cut-off events. [2024-06-14 15:44:09,536 INFO L125 PetriNetUnfolderBase]: For 91633/91633 co-relation queries the response was YES. [2024-06-14 15:44:09,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 916 events. 467/916 cut-off events. For 91633/91633 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4877 event pairs, 91 based on Foata normal form. 2/916 useless extension candidates. Maximal degree in co-relation 4896. Up to 635 conditions per place. [2024-06-14 15:44:09,546 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 118 selfloop transitions, 59 changer transitions 0/179 dead transitions. [2024-06-14 15:44:09,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 179 transitions, 1728 flow [2024-06-14 15:44:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:44:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:44:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-14 15:44:09,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:44:09,548 INFO L175 Difference]: Start difference. First operand has 242 places, 157 transitions, 1289 flow. Second operand 12 states and 132 transitions. [2024-06-14 15:44:09,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 179 transitions, 1728 flow [2024-06-14 15:44:09,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 179 transitions, 1600 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-14 15:44:09,804 INFO L231 Difference]: Finished difference. Result has 239 places, 158 transitions, 1314 flow [2024-06-14 15:44:09,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1314, PETRI_PLACES=239, PETRI_TRANSITIONS=158} [2024-06-14 15:44:09,805 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-14 15:44:09,805 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 158 transitions, 1314 flow [2024-06-14 15:44:09,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:09,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:09,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:09,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:44:09,805 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:09,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1151153938, now seen corresponding path program 20 times [2024-06-14 15:44:09,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505704394] [2024-06-14 15:44:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:14,496 INFO 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:44:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505704394] [2024-06-14 15:44:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505704394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:14,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709562174] [2024-06-14 15:44:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:14,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:14,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:14,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:14,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:14,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 158 transitions, 1314 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:14,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:14,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:14,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:15,041 INFO L124 PetriNetUnfolderBase]: 471/924 cut-off events. [2024-06-14 15:44:15,041 INFO L125 PetriNetUnfolderBase]: For 86072/86072 co-relation queries the response was YES. [2024-06-14 15:44:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5053 conditions, 924 events. 471/924 cut-off events. For 86072/86072 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4925 event pairs, 105 based on Foata normal form. 2/924 useless extension candidates. Maximal degree in co-relation 4938. Up to 643 conditions per place. [2024-06-14 15:44:15,048 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 126 selfloop transitions, 51 changer transitions 0/179 dead transitions. [2024-06-14 15:44:15,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 179 transitions, 1753 flow [2024-06-14 15:44:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:44:15,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:44:15,050 INFO L175 Difference]: Start difference. First operand has 239 places, 158 transitions, 1314 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:44:15,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 179 transitions, 1753 flow [2024-06-14 15:44:15,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 179 transitions, 1618 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 15:44:15,291 INFO L231 Difference]: Finished difference. Result has 241 places, 159 transitions, 1318 flow [2024-06-14 15:44:15,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1318, PETRI_PLACES=241, PETRI_TRANSITIONS=159} [2024-06-14 15:44:15,292 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-14 15:44:15,292 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 159 transitions, 1318 flow [2024-06-14 15:44:15,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:15,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:15,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:15,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:44:15,293 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:15,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash -18330370, now seen corresponding path program 21 times [2024-06-14 15:44:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767929400] [2024-06-14 15:44:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:20,245 INFO 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:44:20,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:20,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767929400] [2024-06-14 15:44:20,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767929400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:20,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:20,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:20,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463494040] [2024-06-14 15:44:20,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:20,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:20,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:20,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:20,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:20,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:20,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 159 transitions, 1318 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:44:20,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:20,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:20,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:20,779 INFO L124 PetriNetUnfolderBase]: 511/1004 cut-off events. [2024-06-14 15:44:20,780 INFO L125 PetriNetUnfolderBase]: For 143568/143568 co-relation queries the response was YES. [2024-06-14 15:44:20,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6486 conditions, 1004 events. 511/1004 cut-off events. For 143568/143568 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5440 event pairs, 121 based on Foata normal form. 2/1004 useless extension candidates. Maximal degree in co-relation 6370. Up to 606 conditions per place. [2024-06-14 15:44:20,789 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 124 selfloop transitions, 60 changer transitions 0/186 dead transitions. [2024-06-14 15:44:20,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 186 transitions, 2014 flow [2024-06-14 15:44:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:44:20,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:44:20,791 INFO L175 Difference]: Start difference. First operand has 241 places, 159 transitions, 1318 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:44:20,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 186 transitions, 2014 flow [2024-06-14 15:44:21,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 186 transitions, 1875 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-14 15:44:21,135 INFO L231 Difference]: Finished difference. Result has 243 places, 161 transitions, 1371 flow [2024-06-14 15:44:21,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1371, PETRI_PLACES=243, PETRI_TRANSITIONS=161} [2024-06-14 15:44:21,136 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-14 15:44:21,136 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 161 transitions, 1371 flow [2024-06-14 15:44:21,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:44:21,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:21,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:21,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:44:21,136 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:21,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1359155034, now seen corresponding path program 22 times [2024-06-14 15:44:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:21,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385769308] [2024-06-14 15:44:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385769308] [2024-06-14 15:44:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385769308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:26,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:26,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082804906] [2024-06-14 15:44:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:26,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:26,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:26,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 161 transitions, 1371 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:26,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:26,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:26,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:26,914 INFO L124 PetriNetUnfolderBase]: 508/999 cut-off events. [2024-06-14 15:44:26,914 INFO L125 PetriNetUnfolderBase]: For 137337/137337 co-relation queries the response was YES. [2024-06-14 15:44:26,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6259 conditions, 999 events. 508/999 cut-off events. For 137337/137337 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5410 event pairs, 126 based on Foata normal form. 2/999 useless extension candidates. Maximal degree in co-relation 6142. Up to 718 conditions per place. [2024-06-14 15:44:26,925 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 127 selfloop transitions, 52 changer transitions 0/181 dead transitions. [2024-06-14 15:44:26,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 181 transitions, 1783 flow [2024-06-14 15:44:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:44:26,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:44:26,926 INFO L175 Difference]: Start difference. First operand has 243 places, 161 transitions, 1371 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:44:26,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 181 transitions, 1783 flow [2024-06-14 15:44:27,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 181 transitions, 1679 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:27,262 INFO L231 Difference]: Finished difference. Result has 247 places, 161 transitions, 1375 flow [2024-06-14 15:44:27,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1375, PETRI_PLACES=247, PETRI_TRANSITIONS=161} [2024-06-14 15:44:27,263 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-14 15:44:27,263 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 161 transitions, 1375 flow [2024-06-14 15:44:27,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:27,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:27,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:27,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:44:27,263 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:27,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 739837700, now seen corresponding path program 6 times [2024-06-14 15:44:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:27,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010777403] [2024-06-14 15:44:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:32,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:32,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010777403] [2024-06-14 15:44:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010777403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:32,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:32,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:32,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012187486] [2024-06-14 15:44:32,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:32,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:32,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:32,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:32,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:32,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:32,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 161 transitions, 1375 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:44:32,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:32,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:32,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:32,934 INFO L124 PetriNetUnfolderBase]: 495/976 cut-off events. [2024-06-14 15:44:32,935 INFO L125 PetriNetUnfolderBase]: For 130416/130416 co-relation queries the response was YES. [2024-06-14 15:44:32,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 976 events. 495/976 cut-off events. For 130416/130416 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5281 event pairs, 111 based on Foata normal form. 10/984 useless extension candidates. Maximal degree in co-relation 5175. Up to 624 conditions per place. [2024-06-14 15:44:32,944 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 120 selfloop transitions, 56 changer transitions 7/185 dead transitions. [2024-06-14 15:44:32,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 185 transitions, 1815 flow [2024-06-14 15:44:32,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:44:32,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:44:32,945 INFO L175 Difference]: Start difference. First operand has 247 places, 161 transitions, 1375 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:44:32,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 185 transitions, 1815 flow [2024-06-14 15:44:33,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 185 transitions, 1665 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-14 15:44:33,215 INFO L231 Difference]: Finished difference. Result has 247 places, 158 transitions, 1323 flow [2024-06-14 15:44:33,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1323, PETRI_PLACES=247, PETRI_TRANSITIONS=158} [2024-06-14 15:44:33,216 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-14 15:44:33,216 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 158 transitions, 1323 flow [2024-06-14 15:44:33,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:44:33,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:33,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:33,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:44:33,217 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:33,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1359431740, now seen corresponding path program 7 times [2024-06-14 15:44:33,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:33,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126863872] [2024-06-14 15:44:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:37,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:37,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126863872] [2024-06-14 15:44:37,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126863872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:37,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:37,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902860058] [2024-06-14 15:44:37,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:37,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:37,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:37,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:38,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:38,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 158 transitions, 1323 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:44:38,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:38,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:38,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:38,486 INFO L124 PetriNetUnfolderBase]: 498/989 cut-off events. [2024-06-14 15:44:38,487 INFO L125 PetriNetUnfolderBase]: For 151252/151252 co-relation queries the response was YES. [2024-06-14 15:44:38,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5837 conditions, 989 events. 498/989 cut-off events. For 151252/151252 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5368 event pairs, 116 based on Foata normal form. 8/995 useless extension candidates. Maximal degree in co-relation 5717. Up to 590 conditions per place. [2024-06-14 15:44:38,495 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 53 changer transitions 8/184 dead transitions. [2024-06-14 15:44:38,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 184 transitions, 1957 flow [2024-06-14 15:44:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 15:44:38,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-14 15:44:38,496 INFO L175 Difference]: Start difference. First operand has 247 places, 158 transitions, 1323 flow. Second operand 11 states and 133 transitions. [2024-06-14 15:44:38,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 184 transitions, 1957 flow [2024-06-14 15:44:38,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 184 transitions, 1837 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-14 15:44:38,829 INFO L231 Difference]: Finished difference. Result has 246 places, 155 transitions, 1294 flow [2024-06-14 15:44:38,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=246, PETRI_TRANSITIONS=155} [2024-06-14 15:44:38,830 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 215 predicate places. [2024-06-14 15:44:38,830 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 155 transitions, 1294 flow [2024-06-14 15:44:38,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:44:38,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:38,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:38,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 15:44:38,831 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:38,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:38,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1259315254, now seen corresponding path program 23 times [2024-06-14 15:44:38,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:38,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357022331] [2024-06-14 15:44:38,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:43,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:43,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357022331] [2024-06-14 15:44:43,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357022331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:43,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:43,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:43,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093662026] [2024-06-14 15:44:43,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:43,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:43,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:43,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:43,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:43,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:43,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 155 transitions, 1294 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:43,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:43,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:43,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:44,235 INFO L124 PetriNetUnfolderBase]: 512/1015 cut-off events. [2024-06-14 15:44:44,235 INFO L125 PetriNetUnfolderBase]: For 170683/170683 co-relation queries the response was YES. [2024-06-14 15:44:44,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6911 conditions, 1015 events. 512/1015 cut-off events. For 170683/170683 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5522 event pairs, 119 based on Foata normal form. 2/1015 useless extension candidates. Maximal degree in co-relation 6791. Up to 620 conditions per place. [2024-06-14 15:44:44,245 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 113 selfloop transitions, 67 changer transitions 0/182 dead transitions. [2024-06-14 15:44:44,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 182 transitions, 1959 flow [2024-06-14 15:44:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:44:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:44:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-14 15:44:44,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:44:44,246 INFO L175 Difference]: Start difference. First operand has 246 places, 155 transitions, 1294 flow. Second operand 12 states and 140 transitions. [2024-06-14 15:44:44,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 182 transitions, 1959 flow [2024-06-14 15:44:44,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 182 transitions, 1844 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-14 15:44:44,659 INFO L231 Difference]: Finished difference. Result has 244 places, 156 transitions, 1358 flow [2024-06-14 15:44:44,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1358, PETRI_PLACES=244, PETRI_TRANSITIONS=156} [2024-06-14 15:44:44,660 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-14 15:44:44,660 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 156 transitions, 1358 flow [2024-06-14 15:44:44,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:44,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:44,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:44,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 15:44:44,661 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:44,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:44,661 INFO L85 PathProgramCache]: Analyzing trace with hash -110432648, now seen corresponding path program 24 times [2024-06-14 15:44:44,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:44,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718145836] [2024-06-14 15:44:44,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:44,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:49,698 INFO 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:44:49,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:49,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718145836] [2024-06-14 15:44:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718145836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:49,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:49,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:44:49,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633067540] [2024-06-14 15:44:49,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:49,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:44:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:44:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:44:49,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:49,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 156 transitions, 1358 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:49,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:49,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:49,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:50,275 INFO L124 PetriNetUnfolderBase]: 509/1010 cut-off events. [2024-06-14 15:44:50,276 INFO L125 PetriNetUnfolderBase]: For 154885/154885 co-relation queries the response was YES. [2024-06-14 15:44:50,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6663 conditions, 1010 events. 509/1010 cut-off events. For 154885/154885 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5497 event pairs, 126 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 6545. Up to 729 conditions per place. [2024-06-14 15:44:50,285 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 114 selfloop transitions, 61 changer transitions 0/177 dead transitions. [2024-06-14 15:44:50,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 177 transitions, 1764 flow [2024-06-14 15:44:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:44:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:44:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2024-06-14 15:44:50,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3411458333333333 [2024-06-14 15:44:50,287 INFO L175 Difference]: Start difference. First operand has 244 places, 156 transitions, 1358 flow. Second operand 12 states and 131 transitions. [2024-06-14 15:44:50,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 177 transitions, 1764 flow [2024-06-14 15:44:50,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 177 transitions, 1553 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-06-14 15:44:50,697 INFO L231 Difference]: Finished difference. Result has 246 places, 156 transitions, 1273 flow [2024-06-14 15:44:50,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1273, PETRI_PLACES=246, PETRI_TRANSITIONS=156} [2024-06-14 15:44:50,697 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 215 predicate places. [2024-06-14 15:44:50,697 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 156 transitions, 1273 flow [2024-06-14 15:44:50,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:50,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:50,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:50,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 15:44:50,698 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:50,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1003529240, now seen corresponding path program 8 times [2024-06-14 15:44:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886441705] [2024-06-14 15:44:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:56,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:56,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886441705] [2024-06-14 15:44:56,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886441705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:56,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:56,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:56,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942147640] [2024-06-14 15:44:56,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:56,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:56,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:56,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:56,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:56,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:44:56,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 156 transitions, 1273 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:56,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:56,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:44:56,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:56,631 INFO L124 PetriNetUnfolderBase]: 496/987 cut-off events. [2024-06-14 15:44:56,631 INFO L125 PetriNetUnfolderBase]: For 147754/147754 co-relation queries the response was YES. [2024-06-14 15:44:56,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 987 events. 496/987 cut-off events. For 147754/147754 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5354 event pairs, 111 based on Foata normal form. 10/995 useless extension candidates. Maximal degree in co-relation 5378. Up to 644 conditions per place. [2024-06-14 15:44:56,640 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 63 changer transitions 8/181 dead transitions. [2024-06-14 15:44:56,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 181 transitions, 1707 flow [2024-06-14 15:44:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:44:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:44:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2024-06-14 15:44:56,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:44:56,642 INFO L175 Difference]: Start difference. First operand has 246 places, 156 transitions, 1273 flow. Second operand 12 states and 138 transitions. [2024-06-14 15:44:56,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 181 transitions, 1707 flow [2024-06-14 15:44:56,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 181 transitions, 1486 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-14 15:44:56,964 INFO L231 Difference]: Finished difference. Result has 244 places, 152 transitions, 1158 flow [2024-06-14 15:44:56,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1158, PETRI_PLACES=244, PETRI_TRANSITIONS=152} [2024-06-14 15:44:56,964 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-14 15:44:56,965 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 152 transitions, 1158 flow [2024-06-14 15:44:56,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:56,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:56,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:56,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 15:44:56,965 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:56,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1003519940, now seen corresponding path program 9 times [2024-06-14 15:44:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:56,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624406403] [2024-06-14 15:44:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:02,135 INFO 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:45:02,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624406403] [2024-06-14 15:45:02,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624406403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:02,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:02,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:45:02,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439839837] [2024-06-14 15:45:02,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:02,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:45:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:45:02,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:45:02,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:02,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 152 transitions, 1158 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:02,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:02,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:02,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:02,739 INFO L124 PetriNetUnfolderBase]: 497/998 cut-off events. [2024-06-14 15:45:02,740 INFO L125 PetriNetUnfolderBase]: For 169369/169369 co-relation queries the response was YES. [2024-06-14 15:45:02,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5957 conditions, 998 events. 497/998 cut-off events. For 169369/169369 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5458 event pairs, 120 based on Foata normal form. 8/1004 useless extension candidates. Maximal degree in co-relation 5838. Up to 620 conditions per place. [2024-06-14 15:45:02,749 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 109 selfloop transitions, 58 changer transitions 11/180 dead transitions. [2024-06-14 15:45:02,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 180 transitions, 1790 flow [2024-06-14 15:45:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:45:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:45:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 15:45:02,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:45:02,751 INFO L175 Difference]: Start difference. First operand has 244 places, 152 transitions, 1158 flow. Second operand 12 states and 141 transitions. [2024-06-14 15:45:02,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 180 transitions, 1790 flow [2024-06-14 15:45:03,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 180 transitions, 1623 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-06-14 15:45:03,174 INFO L231 Difference]: Finished difference. Result has 242 places, 146 transitions, 1078 flow [2024-06-14 15:45:03,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1078, PETRI_PLACES=242, PETRI_TRANSITIONS=146} [2024-06-14 15:45:03,174 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-14 15:45:03,174 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 146 transitions, 1078 flow [2024-06-14 15:45:03,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:03,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:03,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:03,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 15:45:03,175 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:03,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:03,175 INFO L85 PathProgramCache]: Analyzing trace with hash -993076218, now seen corresponding path program 10 times [2024-06-14 15:45:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:03,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562790913] [2024-06-14 15:45:03,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:08,344 INFO 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:45:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:08,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562790913] [2024-06-14 15:45:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562790913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:45:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081204334] [2024-06-14 15:45:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:08,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:45:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:45:08,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:45:08,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:08,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 146 transitions, 1078 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:08,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:08,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:08,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:08,910 INFO L124 PetriNetUnfolderBase]: 484/979 cut-off events. [2024-06-14 15:45:08,910 INFO L125 PetriNetUnfolderBase]: For 178735/178735 co-relation queries the response was YES. [2024-06-14 15:45:08,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 979 events. 484/979 cut-off events. For 178735/178735 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5316 event pairs, 123 based on Foata normal form. 8/985 useless extension candidates. Maximal degree in co-relation 5865. Up to 518 conditions per place. [2024-06-14 15:45:08,920 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 104 selfloop transitions, 57 changer transitions 11/174 dead transitions. [2024-06-14 15:45:08,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 174 transitions, 1690 flow [2024-06-14 15:45:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:45:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:45:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2024-06-14 15:45:08,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:45:08,929 INFO L175 Difference]: Start difference. First operand has 242 places, 146 transitions, 1078 flow. Second operand 13 states and 143 transitions. [2024-06-14 15:45:08,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 174 transitions, 1690 flow [2024-06-14 15:45:09,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 174 transitions, 1555 flow, removed 10 selfloop flow, removed 14 redundant places. [2024-06-14 15:45:09,254 INFO L231 Difference]: Finished difference. Result has 236 places, 141 transitions, 1039 flow [2024-06-14 15:45:09,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1039, PETRI_PLACES=236, PETRI_TRANSITIONS=141} [2024-06-14 15:45:09,254 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-14 15:45:09,254 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 141 transitions, 1039 flow [2024-06-14 15:45:09,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:09,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:09,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:09,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 15:45:09,255 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:09,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash -380780201, now seen corresponding path program 1 times [2024-06-14 15:45:09,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:09,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890102182] [2024-06-14 15:45:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:09,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:14,654 INFO 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:45:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890102182] [2024-06-14 15:45:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890102182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:45:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115346977] [2024-06-14 15:45:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:14,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:45:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:14,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:45:14,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:45:14,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:14,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 141 transitions, 1039 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:45:14,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:14,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:15,238 INFO L124 PetriNetUnfolderBase]: 466/941 cut-off events. [2024-06-14 15:45:15,239 INFO L125 PetriNetUnfolderBase]: For 155650/155650 co-relation queries the response was YES. [2024-06-14 15:45:15,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 941 events. 466/941 cut-off events. For 155650/155650 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5005 event pairs, 133 based on Foata normal form. 6/945 useless extension candidates. Maximal degree in co-relation 5627. Up to 831 conditions per place. [2024-06-14 15:45:15,247 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 134 selfloop transitions, 8 changer transitions 23/167 dead transitions. [2024-06-14 15:45:15,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 167 transitions, 1431 flow [2024-06-14 15:45:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:45:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:45:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2024-06-14 15:45:15,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3098958333333333 [2024-06-14 15:45:15,248 INFO L175 Difference]: Start difference. First operand has 236 places, 141 transitions, 1039 flow. Second operand 12 states and 119 transitions. [2024-06-14 15:45:15,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 167 transitions, 1431 flow [2024-06-14 15:45:15,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 167 transitions, 1282 flow, removed 6 selfloop flow, removed 13 redundant places. [2024-06-14 15:45:15,523 INFO L231 Difference]: Finished difference. Result has 230 places, 135 transitions, 879 flow [2024-06-14 15:45:15,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=879, PETRI_PLACES=230, PETRI_TRANSITIONS=135} [2024-06-14 15:45:15,523 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2024-06-14 15:45:15,523 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 135 transitions, 879 flow [2024-06-14 15:45:15,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:45:15,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:15,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:15,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 15:45:15,524 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:15,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -332378057, now seen corresponding path program 2 times [2024-06-14 15:45:15,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:15,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847223475] [2024-06-14 15:45:15,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:20,506 INFO 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:45:20,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847223475] [2024-06-14 15:45:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847223475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777225361] [2024-06-14 15:45:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:20,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:20,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:20,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:20,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:20,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 135 transitions, 879 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:20,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:20,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:20,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:20,953 INFO L124 PetriNetUnfolderBase]: 438/887 cut-off events. [2024-06-14 15:45:20,953 INFO L125 PetriNetUnfolderBase]: For 145623/145623 co-relation queries the response was YES. [2024-06-14 15:45:20,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5291 conditions, 887 events. 438/887 cut-off events. For 145623/145623 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4665 event pairs, 76 based on Foata normal form. 6/891 useless extension candidates. Maximal degree in co-relation 5180. Up to 278 conditions per place. [2024-06-14 15:45:20,961 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 75 selfloop transitions, 54 changer transitions 22/153 dead transitions. [2024-06-14 15:45:20,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 153 transitions, 1221 flow [2024-06-14 15:45:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2024-06-14 15:45:20,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29829545454545453 [2024-06-14 15:45:20,963 INFO L175 Difference]: Start difference. First operand has 230 places, 135 transitions, 879 flow. Second operand 11 states and 105 transitions. [2024-06-14 15:45:20,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 153 transitions, 1221 flow [2024-06-14 15:45:21,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 153 transitions, 1193 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-14 15:45:21,213 INFO L231 Difference]: Finished difference. Result has 219 places, 123 transitions, 897 flow [2024-06-14 15:45:21,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=897, PETRI_PLACES=219, PETRI_TRANSITIONS=123} [2024-06-14 15:45:21,213 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-14 15:45:21,214 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 123 transitions, 897 flow [2024-06-14 15:45:21,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:21,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:21,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:21,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 15:45:21,214 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:21,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1701567083, now seen corresponding path program 3 times [2024-06-14 15:45:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:21,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363340151] [2024-06-14 15:45:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:26,709 INFO 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:45:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363340151] [2024-06-14 15:45:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363340151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:26,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:45:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44957173] [2024-06-14 15:45:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:26,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:45:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:45:26,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:45:26,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:26,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 123 transitions, 897 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:45:26,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:26,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:26,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:27,282 INFO L124 PetriNetUnfolderBase]: 396/813 cut-off events. [2024-06-14 15:45:27,282 INFO L125 PetriNetUnfolderBase]: For 130074/130074 co-relation queries the response was YES. [2024-06-14 15:45:27,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 813 events. 396/813 cut-off events. For 130074/130074 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4219 event pairs, 111 based on Foata normal form. 6/817 useless extension candidates. Maximal degree in co-relation 4953. Up to 687 conditions per place. [2024-06-14 15:45:27,288 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 17 changer transitions 10/146 dead transitions. [2024-06-14 15:45:27,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 146 transitions, 1243 flow [2024-06-14 15:45:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:45:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:45:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2024-06-14 15:45:27,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3072916666666667 [2024-06-14 15:45:27,290 INFO L175 Difference]: Start difference. First operand has 219 places, 123 transitions, 897 flow. Second operand 12 states and 118 transitions. [2024-06-14 15:45:27,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 146 transitions, 1243 flow [2024-06-14 15:45:27,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 146 transitions, 1117 flow, removed 9 selfloop flow, removed 15 redundant places. [2024-06-14 15:45:27,449 INFO L231 Difference]: Finished difference. Result has 204 places, 119 transitions, 784 flow [2024-06-14 15:45:27,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=784, PETRI_PLACES=204, PETRI_TRANSITIONS=119} [2024-06-14 15:45:27,450 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-14 15:45:27,450 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 119 transitions, 784 flow [2024-06-14 15:45:27,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:45:27,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:27,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:27,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 15:45:27,450 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:27,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1048378739, now seen corresponding path program 4 times [2024-06-14 15:45:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637080072] [2024-06-14 15:45:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:27,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:32,726 INFO 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:45:32,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637080072] [2024-06-14 15:45:32,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637080072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:32,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:32,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:45:32,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125981147] [2024-06-14 15:45:32,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:32,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:45:32,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:45:32,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:45:32,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:32,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 119 transitions, 784 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:45:32,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:32,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:32,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:33,228 INFO L124 PetriNetUnfolderBase]: 384/793 cut-off events. [2024-06-14 15:45:33,228 INFO L125 PetriNetUnfolderBase]: For 106581/106581 co-relation queries the response was YES. [2024-06-14 15:45:33,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 793 events. 384/793 cut-off events. For 106581/106581 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4092 event pairs, 113 based on Foata normal form. 6/797 useless extension candidates. Maximal degree in co-relation 4542. Up to 683 conditions per place. [2024-06-14 15:45:33,235 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 111 selfloop transitions, 12 changer transitions 17/142 dead transitions. [2024-06-14 15:45:33,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 142 transitions, 1124 flow [2024-06-14 15:45:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:45:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:45:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2024-06-14 15:45:33,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3020833333333333 [2024-06-14 15:45:33,236 INFO L175 Difference]: Start difference. First operand has 204 places, 119 transitions, 784 flow. Second operand 12 states and 116 transitions. [2024-06-14 15:45:33,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 142 transitions, 1124 flow [2024-06-14 15:45:33,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 142 transitions, 1084 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-14 15:45:33,405 INFO L231 Difference]: Finished difference. Result has 200 places, 112 transitions, 719 flow [2024-06-14 15:45:33,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=719, PETRI_PLACES=200, PETRI_TRANSITIONS=112} [2024-06-14 15:45:33,405 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-14 15:45:33,405 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 112 transitions, 719 flow [2024-06-14 15:45:33,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:45:33,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:33,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:33,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 15:45:33,406 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:33,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1053020369, now seen corresponding path program 5 times [2024-06-14 15:45:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511271171] [2024-06-14 15:45:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:38,425 INFO 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:45:38,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:38,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511271171] [2024-06-14 15:45:38,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511271171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:38,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:38,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366076995] [2024-06-14 15:45:38,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:38,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:38,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:38,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:38,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:38,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:38,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 112 transitions, 719 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:38,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:38,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:38,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:38,882 INFO L124 PetriNetUnfolderBase]: 366/759 cut-off events. [2024-06-14 15:45:38,882 INFO L125 PetriNetUnfolderBase]: For 101233/101233 co-relation queries the response was YES. [2024-06-14 15:45:38,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4440 conditions, 759 events. 366/759 cut-off events. For 101233/101233 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3887 event pairs, 91 based on Foata normal form. 6/763 useless extension candidates. Maximal degree in co-relation 4357. Up to 340 conditions per place. [2024-06-14 15:45:38,888 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 37 changer transitions 27/130 dead transitions. [2024-06-14 15:45:38,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 130 transitions, 1017 flow [2024-06-14 15:45:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-14 15:45:38,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3153409090909091 [2024-06-14 15:45:38,889 INFO L175 Difference]: Start difference. First operand has 200 places, 112 transitions, 719 flow. Second operand 11 states and 111 transitions. [2024-06-14 15:45:38,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 130 transitions, 1017 flow [2024-06-14 15:45:39,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 130 transitions, 985 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:45:39,051 INFO L231 Difference]: Finished difference. Result has 191 places, 93 transitions, 650 flow [2024-06-14 15:45:39,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=650, PETRI_PLACES=191, PETRI_TRANSITIONS=93} [2024-06-14 15:45:39,051 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-14 15:45:39,051 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 93 transitions, 650 flow [2024-06-14 15:45:39,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:39,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:39,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:39,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 15:45:39,052 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:39,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash 541929835, now seen corresponding path program 6 times [2024-06-14 15:45:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279659662] [2024-06-14 15:45:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:44,081 INFO 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:45:44,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279659662] [2024-06-14 15:45:44,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279659662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:44,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:44,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:45:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002229969] [2024-06-14 15:45:44,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:44,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:45:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:45:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:45:44,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:44,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 93 transitions, 650 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:45:44,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:44,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:44,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:44,528 INFO L124 PetriNetUnfolderBase]: 291/608 cut-off events. [2024-06-14 15:45:44,528 INFO L125 PetriNetUnfolderBase]: For 77696/77696 co-relation queries the response was YES. [2024-06-14 15:45:44,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 608 events. 291/608 cut-off events. For 77696/77696 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2933 event pairs, 76 based on Foata normal form. 6/612 useless extension candidates. Maximal degree in co-relation 3469. Up to 333 conditions per place. [2024-06-14 15:45:44,533 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 60 selfloop transitions, 30 changer transitions 19/111 dead transitions. [2024-06-14 15:45:44,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 111 transitions, 914 flow [2024-06-14 15:45:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-14 15:45:44,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-14 15:45:44,534 INFO L175 Difference]: Start difference. First operand has 191 places, 93 transitions, 650 flow. Second operand 11 states and 110 transitions. [2024-06-14 15:45:44,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 111 transitions, 914 flow [2024-06-14 15:45:44,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 111 transitions, 804 flow, removed 17 selfloop flow, removed 22 redundant places. [2024-06-14 15:45:44,631 INFO L231 Difference]: Finished difference. Result has 162 places, 81 transitions, 550 flow [2024-06-14 15:45:44,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=550, PETRI_PLACES=162, PETRI_TRANSITIONS=81} [2024-06-14 15:45:44,631 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-14 15:45:44,631 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 81 transitions, 550 flow [2024-06-14 15:45:44,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:45:44,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:44,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:44,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 15:45:44,633 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:44,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 313855705, now seen corresponding path program 7 times [2024-06-14 15:45:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306056483] [2024-06-14 15:45:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:49,806 INFO 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:45:49,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306056483] [2024-06-14 15:45:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306056483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:49,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:49,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:45:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810134419] [2024-06-14 15:45:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:49,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:45:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:45:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:45:49,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:49,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 81 transitions, 550 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:45:49,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:49,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:49,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:50,296 INFO L124 PetriNetUnfolderBase]: 253/538 cut-off events. [2024-06-14 15:45:50,296 INFO L125 PetriNetUnfolderBase]: For 53934/53934 co-relation queries the response was YES. [2024-06-14 15:45:50,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 538 events. 253/538 cut-off events. For 53934/53934 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2495 event pairs, 70 based on Foata normal form. 6/542 useless extension candidates. Maximal degree in co-relation 2918. Up to 279 conditions per place. [2024-06-14 15:45:50,300 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 44 selfloop transitions, 18 changer transitions 35/99 dead transitions. [2024-06-14 15:45:50,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 99 transitions, 784 flow [2024-06-14 15:45:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2024-06-14 15:45:50,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2024-06-14 15:45:50,301 INFO L175 Difference]: Start difference. First operand has 162 places, 81 transitions, 550 flow. Second operand 11 states and 108 transitions. [2024-06-14 15:45:50,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 99 transitions, 784 flow [2024-06-14 15:45:50,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 99 transitions, 706 flow, removed 9 selfloop flow, removed 17 redundant places. [2024-06-14 15:45:50,360 INFO L231 Difference]: Finished difference. Result has 146 places, 60 transitions, 401 flow [2024-06-14 15:45:50,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=401, PETRI_PLACES=146, PETRI_TRANSITIONS=60} [2024-06-14 15:45:50,360 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-14 15:45:50,360 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 60 transitions, 401 flow [2024-06-14 15:45:50,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:45:50,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:50,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:50,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 15:45:50,361 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:50,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1728994633, now seen corresponding path program 8 times [2024-06-14 15:45:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:50,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174176668] [2024-06-14 15:45:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:56,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174176668] [2024-06-14 15:45:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174176668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:56,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-14 15:45:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191251776] [2024-06-14 15:45:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:56,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-14 15:45:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-14 15:45:56,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-06-14 15:45:56,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:45:56,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 60 transitions, 401 flow. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:56,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:56,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:45:56,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:56,611 INFO L124 PetriNetUnfolderBase]: 186/400 cut-off events. [2024-06-14 15:45:56,612 INFO L125 PetriNetUnfolderBase]: For 40418/40418 co-relation queries the response was YES. [2024-06-14 15:45:56,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 400 events. 186/400 cut-off events. For 40418/40418 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1751 event pairs, 68 based on Foata normal form. 6/405 useless extension candidates. Maximal degree in co-relation 2297. Up to 263 conditions per place. [2024-06-14 15:45:56,614 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 44 selfloop transitions, 18 changer transitions 12/76 dead transitions. [2024-06-14 15:45:56,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 76 transitions, 583 flow [2024-06-14 15:45:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:45:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:45:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2024-06-14 15:45:56,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2864583333333333 [2024-06-14 15:45:56,615 INFO L175 Difference]: Start difference. First operand has 146 places, 60 transitions, 401 flow. Second operand 12 states and 110 transitions. [2024-06-14 15:45:56,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 76 transitions, 583 flow [2024-06-14 15:45:56,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 76 transitions, 499 flow, removed 15 selfloop flow, removed 25 redundant places. [2024-06-14 15:45:56,643 INFO L231 Difference]: Finished difference. Result has 115 places, 56 transitions, 336 flow [2024-06-14 15:45:56,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=336, PETRI_PLACES=115, PETRI_TRANSITIONS=56} [2024-06-14 15:45:56,643 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-14 15:45:56,644 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 56 transitions, 336 flow [2024-06-14 15:45:56,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:56,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:56,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:56,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-14 15:45:56,644 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:56,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -383892851, now seen corresponding path program 9 times [2024-06-14 15:45:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:56,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548584953] [2024-06-14 15:45:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:56,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:01,779 INFO 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:46:01,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:01,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548584953] [2024-06-14 15:46:01,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548584953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:01,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:01,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:46:01,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128741780] [2024-06-14 15:46:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:01,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:46:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:01,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:46:01,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:46:02,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:46:02,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 56 transitions, 336 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:46:02,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:02,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:46:02,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:02,388 INFO L124 PetriNetUnfolderBase]: 162/348 cut-off events. [2024-06-14 15:46:02,388 INFO L125 PetriNetUnfolderBase]: For 17266/17266 co-relation queries the response was YES. [2024-06-14 15:46:02,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 348 events. 162/348 cut-off events. For 17266/17266 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1440 event pairs, 55 based on Foata normal form. 6/353 useless extension candidates. Maximal degree in co-relation 1598. Up to 220 conditions per place. [2024-06-14 15:46:02,390 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 41 selfloop transitions, 16 changer transitions 11/70 dead transitions. [2024-06-14 15:46:02,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 70 transitions, 502 flow [2024-06-14 15:46:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-14 15:46:02,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2869318181818182 [2024-06-14 15:46:02,391 INFO L175 Difference]: Start difference. First operand has 115 places, 56 transitions, 336 flow. Second operand 11 states and 101 transitions. [2024-06-14 15:46:02,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 70 transitions, 502 flow [2024-06-14 15:46:02,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 70 transitions, 458 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-14 15:46:02,403 INFO L231 Difference]: Finished difference. Result has 108 places, 53 transitions, 312 flow [2024-06-14 15:46:02,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=312, PETRI_PLACES=108, PETRI_TRANSITIONS=53} [2024-06-14 15:46:02,404 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-14 15:46:02,404 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 53 transitions, 312 flow [2024-06-14 15:46:02,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:46:02,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:02,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:02,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-14 15:46:02,405 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:02,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:02,405 INFO L85 PathProgramCache]: Analyzing trace with hash -384065831, now seen corresponding path program 10 times [2024-06-14 15:46:02,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:02,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615397666] [2024-06-14 15:46:02,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615397666] [2024-06-14 15:46:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615397666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:46:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972565301] [2024-06-14 15:46:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:07,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:46:07,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:46:07,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:46:07,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:46:07,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 53 transitions, 312 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:46:07,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:07,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:46:07,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:08,175 INFO L124 PetriNetUnfolderBase]: 152/330 cut-off events. [2024-06-14 15:46:08,175 INFO L125 PetriNetUnfolderBase]: For 14677/14677 co-relation queries the response was YES. [2024-06-14 15:46:08,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 330 events. 152/330 cut-off events. For 14677/14677 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1336 event pairs, 51 based on Foata normal form. 6/335 useless extension candidates. Maximal degree in co-relation 1488. Up to 196 conditions per place. [2024-06-14 15:46:08,177 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 39 selfloop transitions, 15 changer transitions 11/67 dead transitions. [2024-06-14 15:46:08,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 67 transitions, 472 flow [2024-06-14 15:46:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-14 15:46:08,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2869318181818182 [2024-06-14 15:46:08,178 INFO L175 Difference]: Start difference. First operand has 108 places, 53 transitions, 312 flow. Second operand 11 states and 101 transitions. [2024-06-14 15:46:08,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 67 transitions, 472 flow [2024-06-14 15:46:08,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 67 transitions, 434 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:46:08,189 INFO L231 Difference]: Finished difference. Result has 103 places, 48 transitions, 283 flow [2024-06-14 15:46:08,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=283, PETRI_PLACES=103, PETRI_TRANSITIONS=48} [2024-06-14 15:46:08,189 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-14 15:46:08,190 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 48 transitions, 283 flow [2024-06-14 15:46:08,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:46:08,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:08,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:08,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-14 15:46:08,190 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:08,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 871556587, now seen corresponding path program 11 times [2024-06-14 15:46:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034344506] [2024-06-14 15:46:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:13,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:46:13,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:13,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034344506] [2024-06-14 15:46:13,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034344506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:13,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:13,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:46:13,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358079370] [2024-06-14 15:46:13,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:13,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:46:13,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:46:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:46:13,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:46:13,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 48 transitions, 283 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:46:13,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:13,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:46:13,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:13,883 INFO L124 PetriNetUnfolderBase]: 124/270 cut-off events. [2024-06-14 15:46:13,883 INFO L125 PetriNetUnfolderBase]: For 9774/9774 co-relation queries the response was YES. [2024-06-14 15:46:13,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 270 events. 124/270 cut-off events. For 9774/9774 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 996 event pairs, 40 based on Foata normal form. 6/275 useless extension candidates. Maximal degree in co-relation 1110. Up to 159 conditions per place. [2024-06-14 15:46:13,884 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 32 selfloop transitions, 11 changer transitions 17/62 dead transitions. [2024-06-14 15:46:13,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 62 transitions, 433 flow [2024-06-14 15:46:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:46:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:46:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2024-06-14 15:46:13,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2024-06-14 15:46:13,885 INFO L175 Difference]: Start difference. First operand has 103 places, 48 transitions, 283 flow. Second operand 12 states and 104 transitions. [2024-06-14 15:46:13,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 62 transitions, 433 flow [2024-06-14 15:46:13,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 62 transitions, 393 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-14 15:46:13,892 INFO L231 Difference]: Finished difference. Result has 96 places, 42 transitions, 238 flow [2024-06-14 15:46:13,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=238, PETRI_PLACES=96, PETRI_TRANSITIONS=42} [2024-06-14 15:46:13,893 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-14 15:46:13,893 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 42 transitions, 238 flow [2024-06-14 15:46:13,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:46:13,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:13,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:13,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-14 15:46:13,894 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:13,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -815865527, now seen corresponding path program 12 times [2024-06-14 15:46:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928424436] [2024-06-14 15:46:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:18,767 INFO 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:46:18,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:18,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928424436] [2024-06-14 15:46:18,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928424436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:18,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:18,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470658095] [2024-06-14 15:46:18,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:18,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:18,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:18,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:18,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:46:18,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 42 transitions, 238 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:46:18,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:18,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:46:18,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:19,122 INFO L124 PetriNetUnfolderBase]: 98/212 cut-off events. [2024-06-14 15:46:19,122 INFO L125 PetriNetUnfolderBase]: For 5044/5044 co-relation queries the response was YES. [2024-06-14 15:46:19,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 212 events. 98/212 cut-off events. For 5044/5044 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 704 event pairs, 21 based on Foata normal form. 6/217 useless extension candidates. Maximal degree in co-relation 734. Up to 96 conditions per place. [2024-06-14 15:46:19,123 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 26 selfloop transitions, 9 changer transitions 18/55 dead transitions. [2024-06-14 15:46:19,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 55 transitions, 372 flow [2024-06-14 15:46:19,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:46:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:46:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2024-06-14 15:46:19,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2875 [2024-06-14 15:46:19,124 INFO L175 Difference]: Start difference. First operand has 96 places, 42 transitions, 238 flow. Second operand 10 states and 92 transitions. [2024-06-14 15:46:19,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 55 transitions, 372 flow [2024-06-14 15:46:19,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 55 transitions, 338 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-14 15:46:19,128 INFO L231 Difference]: Finished difference. Result has 82 places, 32 transitions, 177 flow [2024-06-14 15:46:19,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=177, PETRI_PLACES=82, PETRI_TRANSITIONS=32} [2024-06-14 15:46:19,129 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-14 15:46:19,129 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 32 transitions, 177 flow [2024-06-14 15:46:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:46:19,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:19,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:19,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-14 15:46:19,129 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:19,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1043939657, now seen corresponding path program 13 times [2024-06-14 15:46:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451678097] [2024-06-14 15:46:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:24,164 INFO 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:46:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451678097] [2024-06-14 15:46:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451678097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798414453] [2024-06-14 15:46:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:24,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:24,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:46:24,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 32 transitions, 177 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:46:24,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:24,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:46:24,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:24,545 INFO L124 PetriNetUnfolderBase]: 69/157 cut-off events. [2024-06-14 15:46:24,545 INFO L125 PetriNetUnfolderBase]: For 3450/3450 co-relation queries the response was YES. [2024-06-14 15:46:24,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 157 events. 69/157 cut-off events. For 3450/3450 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 447 event pairs, 17 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 548. Up to 60 conditions per place. [2024-06-14 15:46:24,546 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 19 selfloop transitions, 5 changer transitions 19/45 dead transitions. [2024-06-14 15:46:24,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 45 transitions, 291 flow [2024-06-14 15:46:24,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:46:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:46:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2024-06-14 15:46:24,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28125 [2024-06-14 15:46:24,547 INFO L175 Difference]: Start difference. First operand has 82 places, 32 transitions, 177 flow. Second operand 10 states and 90 transitions. [2024-06-14 15:46:24,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 45 transitions, 291 flow [2024-06-14 15:46:24,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 45 transitions, 257 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-14 15:46:24,550 INFO L231 Difference]: Finished difference. Result has 67 places, 23 transitions, 116 flow [2024-06-14 15:46:24,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=116, PETRI_PLACES=67, PETRI_TRANSITIONS=23} [2024-06-14 15:46:24,551 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-14 15:46:24,551 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 23 transitions, 116 flow [2024-06-14 15:46:24,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:46:24,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:24,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:24,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-14 15:46:24,552 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:24,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1363170795, now seen corresponding path program 14 times [2024-06-14 15:46:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:24,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78893314] [2024-06-14 15:46:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:24,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:29,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:29,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78893314] [2024-06-14 15:46:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78893314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:29,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:29,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145747463] [2024-06-14 15:46:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:29,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:29,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:29,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:29,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:29,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:46:29,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 23 transitions, 116 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:46:29,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:29,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:46:29,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:30,140 INFO L124 PetriNetUnfolderBase]: 27/71 cut-off events. [2024-06-14 15:46:30,140 INFO L125 PetriNetUnfolderBase]: For 870/870 co-relation queries the response was YES. [2024-06-14 15:46:30,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 71 events. 27/71 cut-off events. For 870/870 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 6/76 useless extension candidates. Maximal degree in co-relation 182. Up to 24 conditions per place. [2024-06-14 15:46:30,140 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 0 selfloop transitions, 0 changer transitions 31/31 dead transitions. [2024-06-14 15:46:30,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 31 transitions, 156 flow [2024-06-14 15:46:30,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:46:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:46:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2024-06-14 15:46:30,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25 [2024-06-14 15:46:30,142 INFO L175 Difference]: Start difference. First operand has 67 places, 23 transitions, 116 flow. Second operand 10 states and 80 transitions. [2024-06-14 15:46:30,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 31 transitions, 156 flow [2024-06-14 15:46:30,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 126 flow, removed 1 selfloop flow, removed 15 redundant places. [2024-06-14 15:46:30,142 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2024-06-14 15:46:30,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2024-06-14 15:46:30,143 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-14 15:46:30,143 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2024-06-14 15:46:30,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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:46:30,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 15:46:30,146 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 15:46:30,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 15:46:30,150 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 15:46:30,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-14 15:46:30,151 INFO L445 BasicCegarLoop]: Path program histogram: [24, 14, 14, 11, 10, 7, 6, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:30,153 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 15:46:30,153 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 15:46:30,158 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 15:46:30,158 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 15:46:30,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 03:46:30 BasicIcfg [2024-06-14 15:46:30,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 15:46:30,160 INFO L158 Benchmark]: Toolchain (without parser) took 648469.08ms. Allocated memory was 165.7MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 133.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 447.7MB. Max. memory is 16.1GB. [2024-06-14 15:46:30,160 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 130.5MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:46:30,160 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:46:30,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.47ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 83.3MB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-14 15:46:30,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.39ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 83.3MB in the beginning and 153.3MB in the end (delta: -70.0MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-06-14 15:46:30,161 INFO L158 Benchmark]: Boogie Preprocessor took 106.31ms. Allocated memory is still 199.2MB. Free memory was 153.3MB in the beginning and 147.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-14 15:46:30,161 INFO L158 Benchmark]: RCFGBuilder took 890.55ms. Allocated memory is still 199.2MB. Free memory was 147.0MB in the beginning and 77.8MB in the end (delta: 69.2MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2024-06-14 15:46:30,161 INFO L158 Benchmark]: TraceAbstraction took 646652.15ms. Allocated memory was 199.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 76.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 356.2MB. Max. memory is 16.1GB. [2024-06-14 15:46:30,162 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 130.5MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.47ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 83.3MB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.39ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 83.3MB in the beginning and 153.3MB in the end (delta: -70.0MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.31ms. Allocated memory is still 199.2MB. Free memory was 153.3MB in the beginning and 147.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 890.55ms. Allocated memory is still 199.2MB. Free memory was 147.0MB in the beginning and 77.8MB in the end (delta: 69.2MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * TraceAbstraction took 646652.15ms. Allocated memory was 199.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 76.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 356.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 803]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 804]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 646.5s, OverallIterations: 127, TraceHistogramMax: 1, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 70.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7216 SdHoareTripleChecker+Valid, 35.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6194 mSDsluCounter, 4182 SdHoareTripleChecker+Invalid, 30.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3470 mSDsCounter, 1435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43115 IncrementalHoareTripleChecker+Invalid, 44550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1435 mSolverCounterUnsat, 712 mSDtfsCounter, 43115 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1386 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2543 ImplicationChecksByTransitivity, 33.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=57, InterpolantAutomatonStates: 1267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 571.8s InterpolantComputationTime, 2191 NumberOfCodeBlocks, 2191 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 2064 ConstructedInterpolants, 0 QuantifiedInterpolants, 98669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 127 InterpolantComputations, 127 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 15:46:30,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE