./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 13:51:33,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 13:51:33,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 13:51:33,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 13:51:33,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 13:51:33,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 13:51:33,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 13:51:33,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 13:51:33,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 13:51:33,696 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 13:51:33,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 13:51:33,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 13:51:33,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 13:51:33,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 13:51:33,698 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 13:51:33,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 13:51:33,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 13:51:33,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 13:51:33,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 13:51:33,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 13:51:33,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 13:51:33,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 13:51:33,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 13:51:33,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 13:51:33,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 13:51:33,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 13:51:33,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 13:51:33,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 13:51:33,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 13:51:33,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 13:51:33,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 13:51:33,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 13:51:33,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 13:51:33,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 13:51:33,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 13:51:33,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 13:51:33,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 13:51:33,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 13:51:33,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 13:51:33,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 13:51:33,730 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 13:51:33,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 13:51:33,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 13:51:33,730 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 13:51:34,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 13:51:34,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 13:51:34,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 13:51:34,028 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 13:51:34,029 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 13:51:34,030 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/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-14 13:51:34,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 13:51:34,205 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 13:51:34,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 13:51:35,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 13:51:35,642 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 13:51:35,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 13:51:35,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e06bdda/7663ae53b71747328bf1db82b4aeac4a/FLAG616ee2dc6 [2024-06-14 13:51:35,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e06bdda/7663ae53b71747328bf1db82b4aeac4a [2024-06-14 13:51:35,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 13:51:35,709 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 13:51:35,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 13:51:35,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 13:51:35,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 13:51:35,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:51:34" (1/2) ... [2024-06-14 13:51:35,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c13228 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 01:51:35, skipping insertion in model container [2024-06-14 13:51:35,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:51:34" (1/2) ... [2024-06-14 13:51:35,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7be7a1f4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 01:51:35, skipping insertion in model container [2024-06-14 13:51:35,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 01:51:35" (2/2) ... [2024-06-14 13:51:35,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c13228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:35, skipping insertion in model container [2024-06-14 13:51:35,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 01:51:35" (2/2) ... [2024-06-14 13:51:35,723 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 13:51:35,808 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 13:51:35,809 INFO L97 edCorrectnessWitness]: Location invariant before [L840-L840] ((((((((((((((((! multithreaded || (0 <= __unbuffered_p1_EBX && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2))) && (! 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_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_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_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_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$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$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) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 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_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_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_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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_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_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_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 )__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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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$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$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_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$$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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 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) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_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) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_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_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_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 )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 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 <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && 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) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_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)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) [2024-06-14 13:51:35,810 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((! multithreaded || (0 <= __unbuffered_p1_EBX && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2))) && (! 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_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_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_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_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$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$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) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 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_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_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_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (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_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_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_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 )__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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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$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$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_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$$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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 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) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_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) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_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_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_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 )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 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 <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && 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) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_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)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) [2024-06-14 13:51:35,811 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 13:51:35,811 INFO L106 edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1; [2024-06-14 13:51:35,857 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 13:51:36,275 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 13:51:36,284 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 13:51:36,547 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 13:51:36,596 INFO L206 MainTranslator]: Completed translation [2024-06-14 13:51:36,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36 WrapperNode [2024-06-14 13:51:36,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 13:51:36,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 13:51:36,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 13:51:36,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 13:51:36,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,738 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2024-06-14 13:51:36,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 13:51:36,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 13:51:36,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 13:51:36,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 13:51:36,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,830 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 13:51:36,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 13:51:36,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 13:51:36,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 13:51:36,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 13:51:36,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (1/1) ... [2024-06-14 13:51:36,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 13:51:36,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:51:36,995 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 13:51:37,000 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 13:51:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 13:51:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 13:51:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 13:51:37,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 13:51:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 13:51:37,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 13:51:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 13:51:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 13:51:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 13:51:37,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 13:51:37,047 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 13:51:37,160 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 13:51:37,162 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 13:51:38,078 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 13:51:38,079 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 13:51:38,309 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 13:51:38,309 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 13:51:38,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 01:51:38 BoogieIcfgContainer [2024-06-14 13:51:38,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 13:51:38,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 13:51:38,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 13:51:38,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 13:51:38,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:51:34" (1/4) ... [2024-06-14 13:51:38,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2586d5bb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 01:51:38, skipping insertion in model container [2024-06-14 13:51:38,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 01:51:35" (2/4) ... [2024-06-14 13:51:38,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2586d5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 01:51:38, skipping insertion in model container [2024-06-14 13:51:38,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:51:36" (3/4) ... [2024-06-14 13:51:38,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2586d5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 01:51:38, skipping insertion in model container [2024-06-14 13:51:38,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 01:51:38" (4/4) ... [2024-06-14 13:51:38,318 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 13:51:38,336 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 13:51:38,336 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 13:51:38,337 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 13:51:38,420 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 13:51:38,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 13:51:38,512 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-14 13:51:38,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 13:51:38,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 13:51:38,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 13:51:38,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-14 13:51:38,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 13:51:38,540 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;@4113036b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 13:51:38,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 13:51:38,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 13:51:38,550 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 13:51:38,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 13:51:38,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:38,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 13:51:38,552 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 13:51:38,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:38,557 INFO L85 PathProgramCache]: Analyzing trace with hash -206534661, now seen corresponding path program 1 times [2024-06-14 13:51:38,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:38,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443840867] [2024-06-14 13:51:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:43,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 13:51:43,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443840867] [2024-06-14 13:51:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443840867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:43,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 13:51:43,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884999289] [2024-06-14 13:51:43,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:43,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 13:51:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:43,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 13:51:43,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 13:51:43,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 13:51:43,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:51:43,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:43,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 13:51:43,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:43,451 INFO L124 PetriNetUnfolderBase]: 225/415 cut-off events. [2024-06-14 13:51:43,452 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-14 13:51:43,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 415 events. 225/415 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1563 event pairs, 141 based on Foata normal form. 1/401 useless extension candidates. Maximal degree in co-relation 822. Up to 394 conditions per place. [2024-06-14 13:51:43,458 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 25 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-14 13:51:43,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 127 flow [2024-06-14 13:51:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 13:51:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 13:51:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-06-14 13:51:43,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-06-14 13:51:43,473 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 51 transitions. [2024-06-14 13:51:43,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 127 flow [2024-06-14 13:51:43,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 13:51:43,477 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-14 13:51:43,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-14 13:51:43,483 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-14 13:51:43,483 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-14 13:51:43,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:51:43,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:43,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:43,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 13:51:43,484 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 13:51:43,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash -911296742, now seen corresponding path program 1 times [2024-06-14 13:51:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:43,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679462861] [2024-06-14 13:51:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:46,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679462861] [2024-06-14 13:51:46,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679462861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:46,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:46,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 13:51:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659235995] [2024-06-14 13:51:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:46,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 13:51:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 13:51:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 13:51:46,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 13:51:46,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:51:46,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:46,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 13:51:46,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:46,870 INFO L124 PetriNetUnfolderBase]: 219/411 cut-off events. [2024-06-14 13:51:46,870 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-06-14 13:51:46,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 411 events. 219/411 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1545 event pairs, 99 based on Foata normal form. 4/411 useless extension candidates. Maximal degree in co-relation 906. Up to 366 conditions per place. [2024-06-14 13:51:46,874 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 30 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-14 13:51:46,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 173 flow [2024-06-14 13:51:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 13:51:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 13:51:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-06-14 13:51:46,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-06-14 13:51:46,877 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 65 transitions. [2024-06-14 13:51:46,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 173 flow [2024-06-14 13:51:46,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 13:51:46,879 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-14 13:51:46,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-14 13:51:46,880 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-14 13:51:46,880 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-14 13:51:46,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:51:46,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:46,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:46,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 13:51:46,881 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 13:51:46,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:46,882 INFO L85 PathProgramCache]: Analyzing trace with hash 417178169, now seen corresponding path program 1 times [2024-06-14 13:51:46,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:46,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042793261] [2024-06-14 13:51:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:51,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:51,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042793261] [2024-06-14 13:51:51,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042793261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:51,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:51,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438363638] [2024-06-14 13:51:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:51,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 13:51:51,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 13:51:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 13:51:51,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 13:51:51,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:51:51,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:51,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 13:51:51,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:52,142 INFO L124 PetriNetUnfolderBase]: 213/399 cut-off events. [2024-06-14 13:51:52,143 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-06-14 13:51:52,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 399 events. 213/399 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1474 event pairs, 57 based on Foata normal form. 4/397 useless extension candidates. Maximal degree in co-relation 970. Up to 338 conditions per place. [2024-06-14 13:51:52,148 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 35 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2024-06-14 13:51:52,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 225 flow [2024-06-14 13:51:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-14 13:51:52,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-06-14 13:51:52,153 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 79 transitions. [2024-06-14 13:51:52,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 225 flow [2024-06-14 13:51:52,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 216 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 13:51:52,156 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-14 13:51:52,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-14 13:51:52,157 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-14 13:51:52,158 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-14 13:51:52,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:51:52,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:52,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:52,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 13:51:52,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:51:52,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash -24617233, now seen corresponding path program 1 times [2024-06-14 13:51:52,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:52,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496854519] [2024-06-14 13:51:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:52,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496854519] [2024-06-14 13:51:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496854519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:58,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626636547] [2024-06-14 13:51:58,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:58,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 13:51:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:58,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 13:51:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 13:51:58,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:51:58,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 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 13:51:58,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:58,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:51:58,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:58,529 INFO L124 PetriNetUnfolderBase]: 211/396 cut-off events. [2024-06-14 13:51:58,531 INFO L125 PetriNetUnfolderBase]: For 365/365 co-relation queries the response was YES. [2024-06-14 13:51:58,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 396 events. 211/396 cut-off events. For 365/365 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1477 event pairs, 92 based on Foata normal form. 1/396 useless extension candidates. Maximal degree in co-relation 1049. Up to 368 conditions per place. [2024-06-14 13:51:58,535 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 29 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-14 13:51:58,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 211 flow [2024-06-14 13:51:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 13:51:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 13:51:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-06-14 13:51:58,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 13:51:58,539 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 5 states and 62 transitions. [2024-06-14 13:51:58,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 211 flow [2024-06-14 13:51:58,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 196 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 13:51:58,543 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2024-06-14 13:51:58,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-06-14 13:51:58,544 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-14 13:51:58,545 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2024-06-14 13:51:58,545 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 13:51:58,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:58,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:58,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 13:51:58,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:51:58,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1476282712, now seen corresponding path program 1 times [2024-06-14 13:51:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121401581] [2024-06-14 13:51:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:04,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121401581] [2024-06-14 13:52:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121401581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:04,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:04,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:52:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125304733] [2024-06-14 13:52:04,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:04,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:52:04,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:04,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:52:04,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:52:04,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 13:52:04,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:52:04,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:04,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 13:52:04,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:04,768 INFO L124 PetriNetUnfolderBase]: 207/386 cut-off events. [2024-06-14 13:52:04,768 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2024-06-14 13:52:04,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 386 events. 207/386 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1408 event pairs, 34 based on Foata normal form. 4/389 useless extension candidates. Maximal degree in co-relation 1074. Up to 309 conditions per place. [2024-06-14 13:52:04,771 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-14 13:52:04,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 255 flow [2024-06-14 13:52:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:52:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:52:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-06-14 13:52:04,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 13:52:04,774 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 6 states and 87 transitions. [2024-06-14 13:52:04,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 255 flow [2024-06-14 13:52:04,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 244 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 13:52:04,780 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 136 flow [2024-06-14 13:52:04,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-14 13:52:04,782 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-14 13:52:04,784 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 136 flow [2024-06-14 13:52:04,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:52:04,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:04,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:04,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 13:52:04,790 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 13:52:04,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash -763132608, now seen corresponding path program 1 times [2024-06-14 13:52:04,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:04,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597592283] [2024-06-14 13:52:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:04,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:09,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:09,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597592283] [2024-06-14 13:52:09,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597592283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:09,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:09,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:52:09,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890017705] [2024-06-14 13:52:09,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:09,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:52:09,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:09,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:52:09,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:52:10,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:52:10,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 136 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 13:52:10,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:10,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:52:10,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:10,369 INFO L124 PetriNetUnfolderBase]: 237/422 cut-off events. [2024-06-14 13:52:10,370 INFO L125 PetriNetUnfolderBase]: For 822/822 co-relation queries the response was YES. [2024-06-14 13:52:10,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 422 events. 237/422 cut-off events. For 822/822 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1492 event pairs, 103 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 1263. Up to 407 conditions per place. [2024-06-14 13:52:10,373 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 30 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2024-06-14 13:52:10,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 234 flow [2024-06-14 13:52:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:52:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:52:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-14 13:52:10,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3282828282828283 [2024-06-14 13:52:10,375 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 136 flow. Second operand 6 states and 65 transitions. [2024-06-14 13:52:10,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 234 flow [2024-06-14 13:52:10,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 214 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 13:52:10,377 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 149 flow [2024-06-14 13:52:10,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-14 13:52:10,378 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-14 13:52:10,378 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 149 flow [2024-06-14 13:52:10,379 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 13:52:10,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:10,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:10,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 13:52:10,379 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 13:52:10,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash 178152706, now seen corresponding path program 1 times [2024-06-14 13:52:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545700556] [2024-06-14 13:52:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:14,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545700556] [2024-06-14 13:52:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545700556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:14,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:14,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:52:14,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9768682] [2024-06-14 13:52:14,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:14,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:52:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:14,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:52:14,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:52:14,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:52:14,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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 13:52:14,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:14,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:52:14,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:15,160 INFO L124 PetriNetUnfolderBase]: 226/416 cut-off events. [2024-06-14 13:52:15,161 INFO L125 PetriNetUnfolderBase]: For 1126/1129 co-relation queries the response was YES. [2024-06-14 13:52:15,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 416 events. 226/416 cut-off events. For 1126/1129 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1504 event pairs, 81 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 1295. Up to 362 conditions per place. [2024-06-14 13:52:15,165 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 34 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2024-06-14 13:52:15,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 275 flow [2024-06-14 13:52:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:52:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:52:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-14 13:52:15,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-14 13:52:15,169 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 149 flow. Second operand 6 states and 75 transitions. [2024-06-14 13:52:15,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 275 flow [2024-06-14 13:52:15,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 258 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 13:52:15,174 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 180 flow [2024-06-14 13:52:15,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-06-14 13:52:15,175 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2024-06-14 13:52:15,175 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 180 flow [2024-06-14 13:52:15,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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 13:52:15,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:15,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:15,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 13:52:15,176 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 13:52:15,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2112685646, now seen corresponding path program 2 times [2024-06-14 13:52:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222398060] [2024-06-14 13:52:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:19,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:19,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222398060] [2024-06-14 13:52:19,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222398060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:19,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:19,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 13:52:19,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403155816] [2024-06-14 13:52:19,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:19,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:52:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:19,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:52:19,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:52:19,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:52:19,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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 13:52:19,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:19,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:52:19,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:19,657 INFO L124 PetriNetUnfolderBase]: 224/416 cut-off events. [2024-06-14 13:52:19,658 INFO L125 PetriNetUnfolderBase]: For 1507/1510 co-relation queries the response was YES. [2024-06-14 13:52:19,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 416 events. 224/416 cut-off events. For 1507/1510 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1539 event pairs, 82 based on Foata normal form. 4/417 useless extension candidates. Maximal degree in co-relation 1419. Up to 348 conditions per place. [2024-06-14 13:52:19,661 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 33 selfloop transitions, 14 changer transitions 0/51 dead transitions. [2024-06-14 13:52:19,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 336 flow [2024-06-14 13:52:19,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:52:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:52:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2024-06-14 13:52:19,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-14 13:52:19,662 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 180 flow. Second operand 6 states and 76 transitions. [2024-06-14 13:52:19,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 336 flow [2024-06-14 13:52:19,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 324 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 13:52:19,666 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 229 flow [2024-06-14 13:52:19,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-06-14 13:52:19,667 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-14 13:52:19,667 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 229 flow [2024-06-14 13:52:19,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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 13:52:19,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:19,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:19,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 13:52:19,668 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 13:52:19,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2112694574, now seen corresponding path program 1 times [2024-06-14 13:52:19,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:19,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243562900] [2024-06-14 13:52:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243562900] [2024-06-14 13:52:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243562900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:24,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:24,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:52:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169949756] [2024-06-14 13:52:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:24,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:52:24,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:52:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:52:24,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:52:24,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 229 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 13:52:24,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:24,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:52:24,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:24,472 INFO L124 PetriNetUnfolderBase]: 242/431 cut-off events. [2024-06-14 13:52:24,472 INFO L125 PetriNetUnfolderBase]: For 1835/1835 co-relation queries the response was YES. [2024-06-14 13:52:24,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 431 events. 242/431 cut-off events. For 1835/1835 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1530 event pairs, 80 based on Foata normal form. 1/431 useless extension candidates. Maximal degree in co-relation 1563. Up to 413 conditions per place. [2024-06-14 13:52:24,475 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-06-14 13:52:24,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 353 flow [2024-06-14 13:52:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:52:24,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:52:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-14 13:52:24,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31601731601731603 [2024-06-14 13:52:24,476 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 229 flow. Second operand 7 states and 73 transitions. [2024-06-14 13:52:24,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 353 flow [2024-06-14 13:52:24,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 338 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 13:52:24,480 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 253 flow [2024-06-14 13:52:24,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-06-14 13:52:24,481 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2024-06-14 13:52:24,482 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 253 flow [2024-06-14 13:52:24,482 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 13:52:24,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:24,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:24,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 13:52:24,482 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 13:52:24,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:24,483 INFO L85 PathProgramCache]: Analyzing trace with hash 861943814, now seen corresponding path program 1 times [2024-06-14 13:52:24,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:24,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961485203] [2024-06-14 13:52:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:28,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:28,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961485203] [2024-06-14 13:52:28,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961485203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:28,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:28,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:52:28,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296220481] [2024-06-14 13:52:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:28,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:52:28,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:52:28,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:52:28,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:52:28,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 253 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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 13:52:28,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:28,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:52:28,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:28,983 INFO L124 PetriNetUnfolderBase]: 223/411 cut-off events. [2024-06-14 13:52:28,984 INFO L125 PetriNetUnfolderBase]: For 2202/2202 co-relation queries the response was YES. [2024-06-14 13:52:28,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1592 conditions, 411 events. 223/411 cut-off events. For 2202/2202 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1493 event pairs, 75 based on Foata normal form. 1/411 useless extension candidates. Maximal degree in co-relation 1564. Up to 355 conditions per place. [2024-06-14 13:52:28,987 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 39 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2024-06-14 13:52:28,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 379 flow [2024-06-14 13:52:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:52:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:52:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-14 13:52:28,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-14 13:52:28,989 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 253 flow. Second operand 6 states and 75 transitions. [2024-06-14 13:52:28,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 379 flow [2024-06-14 13:52:28,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 354 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 13:52:28,992 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 258 flow [2024-06-14 13:52:28,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-06-14 13:52:28,993 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-06-14 13:52:28,993 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 258 flow [2024-06-14 13:52:28,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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 13:52:28,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:28,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:28,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 13:52:28,994 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 13:52:28,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1061395551, now seen corresponding path program 1 times [2024-06-14 13:52:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:28,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759071498] [2024-06-14 13:52:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759071498] [2024-06-14 13:52:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759071498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:32,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:32,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:52:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964334901] [2024-06-14 13:52:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:32,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:52:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:32,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:52:32,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:52:33,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:52:33,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 258 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 13:52:33,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:33,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:52:33,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:33,402 INFO L124 PetriNetUnfolderBase]: 246/439 cut-off events. [2024-06-14 13:52:33,402 INFO L125 PetriNetUnfolderBase]: For 2641/2644 co-relation queries the response was YES. [2024-06-14 13:52:33,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 439 events. 246/439 cut-off events. For 2641/2644 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1558 event pairs, 82 based on Foata normal form. 4/441 useless extension candidates. Maximal degree in co-relation 1716. Up to 397 conditions per place. [2024-06-14 13:52:33,406 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 44 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-14 13:52:33,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 414 flow [2024-06-14 13:52:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:52:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:52:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 13:52:33,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.341991341991342 [2024-06-14 13:52:33,407 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 258 flow. Second operand 7 states and 79 transitions. [2024-06-14 13:52:33,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 414 flow [2024-06-14 13:52:33,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 387 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-14 13:52:33,411 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 276 flow [2024-06-14 13:52:33,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2024-06-14 13:52:33,412 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2024-06-14 13:52:33,412 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 276 flow [2024-06-14 13:52:33,412 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 13:52:33,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:33,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:33,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 13:52:33,413 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 13:52:33,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1069014111, now seen corresponding path program 2 times [2024-06-14 13:52:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749152155] [2024-06-14 13:52:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:37,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 13:52:37,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:37,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749152155] [2024-06-14 13:52:37,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749152155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:37,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:37,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:52:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844287645] [2024-06-14 13:52:37,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:37,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:52:37,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:37,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:52:37,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:52:37,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:52:37,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 276 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 13:52:37,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:37,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:52:37,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:38,048 INFO L124 PetriNetUnfolderBase]: 252/450 cut-off events. [2024-06-14 13:52:38,048 INFO L125 PetriNetUnfolderBase]: For 3220/3223 co-relation queries the response was YES. [2024-06-14 13:52:38,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 450 events. 252/450 cut-off events. For 3220/3223 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1618 event pairs, 81 based on Foata normal form. 4/451 useless extension candidates. Maximal degree in co-relation 1844. Up to 373 conditions per place. [2024-06-14 13:52:38,051 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 38 selfloop transitions, 21 changer transitions 0/61 dead transitions. [2024-06-14 13:52:38,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 478 flow [2024-06-14 13:52:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:52:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:52:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-14 13:52:38,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35064935064935066 [2024-06-14 13:52:38,053 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 276 flow. Second operand 7 states and 81 transitions. [2024-06-14 13:52:38,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 478 flow [2024-06-14 13:52:38,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 449 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 13:52:38,057 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 330 flow [2024-06-14 13:52:38,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-06-14 13:52:38,058 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2024-06-14 13:52:38,058 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 330 flow [2024-06-14 13:52:38,058 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 13:52:38,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:38,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:38,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 13:52:38,059 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 13:52:38,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1068747201, now seen corresponding path program 3 times [2024-06-14 13:52:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43686946] [2024-06-14 13:52:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:42,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 13:52:42,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43686946] [2024-06-14 13:52:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43686946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:42,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:42,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 13:52:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346858507] [2024-06-14 13:52:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:42,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 13:52:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 13:52:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 13:52:42,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:52:42,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 330 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 13:52:42,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:42,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:52:42,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:42,746 INFO L124 PetriNetUnfolderBase]: 253/452 cut-off events. [2024-06-14 13:52:42,747 INFO L125 PetriNetUnfolderBase]: For 3742/3745 co-relation queries the response was YES. [2024-06-14 13:52:42,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 452 events. 253/452 cut-off events. For 3742/3745 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1631 event pairs, 87 based on Foata normal form. 4/453 useless extension candidates. Maximal degree in co-relation 1940. Up to 376 conditions per place. [2024-06-14 13:52:42,750 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 40 selfloop transitions, 21 changer transitions 0/63 dead transitions. [2024-06-14 13:52:42,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 526 flow [2024-06-14 13:52:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:52:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:52:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2024-06-14 13:52:42,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.354978354978355 [2024-06-14 13:52:42,752 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 330 flow. Second operand 7 states and 82 transitions. [2024-06-14 13:52:42,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 526 flow [2024-06-14 13:52:42,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 493 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 13:52:42,757 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 364 flow [2024-06-14 13:52:42,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-06-14 13:52:42,758 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2024-06-14 13:52:42,758 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 364 flow [2024-06-14 13:52:42,758 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 13:52:42,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:42,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:42,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 13:52:42,759 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 13:52:42,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1069024031, now seen corresponding path program 1 times [2024-06-14 13:52:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091093117] [2024-06-14 13:52:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:47,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091093117] [2024-06-14 13:52:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091093117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:47,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:52:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167197334] [2024-06-14 13:52:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:47,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:52:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:52:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:52:47,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:52:47,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 364 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 13:52:47,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:47,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:52:47,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:48,123 INFO L124 PetriNetUnfolderBase]: 251/447 cut-off events. [2024-06-14 13:52:48,124 INFO L125 PetriNetUnfolderBase]: For 4078/4078 co-relation queries the response was YES. [2024-06-14 13:52:48,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 447 events. 251/447 cut-off events. For 4078/4078 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1607 event pairs, 81 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 1988. Up to 426 conditions per place. [2024-06-14 13:52:48,127 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 48 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2024-06-14 13:52:48,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 514 flow [2024-06-14 13:52:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:52:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:52:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-14 13:52:48,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2024-06-14 13:52:48,129 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 364 flow. Second operand 8 states and 81 transitions. [2024-06-14 13:52:48,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 514 flow [2024-06-14 13:52:48,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 477 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 13:52:48,134 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 372 flow [2024-06-14 13:52:48,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2024-06-14 13:52:48,135 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2024-06-14 13:52:48,135 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 372 flow [2024-06-14 13:52:48,135 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 13:52:48,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:48,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:48,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 13:52:48,136 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 13:52:48,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash -598658207, now seen corresponding path program 1 times [2024-06-14 13:52:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92252825] [2024-06-14 13:52:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:52,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:52,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92252825] [2024-06-14 13:52:52,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92252825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:52,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:52,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:52:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422345503] [2024-06-14 13:52:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:52,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:52:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:52:52,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:52:52,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:52:52,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 372 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:52:52,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:52,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:52:52,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:53,173 INFO L124 PetriNetUnfolderBase]: 240/440 cut-off events. [2024-06-14 13:52:53,173 INFO L125 PetriNetUnfolderBase]: For 4749/4749 co-relation queries the response was YES. [2024-06-14 13:52:53,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2028 conditions, 440 events. 240/440 cut-off events. For 4749/4749 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1632 event pairs, 57 based on Foata normal form. 2/441 useless extension candidates. Maximal degree in co-relation 1994. Up to 360 conditions per place. [2024-06-14 13:52:53,176 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 52 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2024-06-14 13:52:53,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 546 flow [2024-06-14 13:52:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:52:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:52:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-14 13:52:53,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-14 13:52:53,177 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 372 flow. Second operand 7 states and 88 transitions. [2024-06-14 13:52:53,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 546 flow [2024-06-14 13:52:53,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 517 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 13:52:53,182 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 386 flow [2024-06-14 13:52:53,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2024-06-14 13:52:53,182 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2024-06-14 13:52:53,182 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 386 flow [2024-06-14 13:52:53,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:52:53,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:53,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:53,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 13:52:53,183 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 13:52:53,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:53,184 INFO L85 PathProgramCache]: Analyzing trace with hash 950455887, now seen corresponding path program 2 times [2024-06-14 13:52:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:53,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290371780] [2024-06-14 13:52:53,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:52:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:52:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:52:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290371780] [2024-06-14 13:52:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290371780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:52:58,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:52:58,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:52:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307729572] [2024-06-14 13:52:58,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:52:58,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:52:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:52:58,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:52:58,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:52:58,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:52:58,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 386 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:52:58,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:52:58,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:52:58,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:52:58,484 INFO L124 PetriNetUnfolderBase]: 246/450 cut-off events. [2024-06-14 13:52:58,484 INFO L125 PetriNetUnfolderBase]: For 5446/5446 co-relation queries the response was YES. [2024-06-14 13:52:58,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2150 conditions, 450 events. 246/450 cut-off events. For 5446/5446 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1678 event pairs, 55 based on Foata normal form. 2/451 useless extension candidates. Maximal degree in co-relation 2115. Up to 353 conditions per place. [2024-06-14 13:52:58,487 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 48 selfloop transitions, 16 changer transitions 0/72 dead transitions. [2024-06-14 13:52:58,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 564 flow [2024-06-14 13:52:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:52:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:52:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 13:52:58,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3852813852813853 [2024-06-14 13:52:58,489 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 386 flow. Second operand 7 states and 89 transitions. [2024-06-14 13:52:58,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 564 flow [2024-06-14 13:52:58,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 537 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 13:52:58,493 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 417 flow [2024-06-14 13:52:58,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2024-06-14 13:52:58,494 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2024-06-14 13:52:58,494 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 417 flow [2024-06-14 13:52:58,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:52:58,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:52:58,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:52:58,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 13:52:58,495 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 13:52:58,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:52:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash -598538051, now seen corresponding path program 1 times [2024-06-14 13:52:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:52:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837911373] [2024-06-14 13:52:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:52:58,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:52:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:02,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 13:53:02,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:02,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837911373] [2024-06-14 13:53:02,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837911373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:02,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:02,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:53:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725529957] [2024-06-14 13:53:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:02,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:53:02,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:02,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:53:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:53:03,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:03,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 417 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 13:53:03,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:03,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:03,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:03,421 INFO L124 PetriNetUnfolderBase]: 261/464 cut-off events. [2024-06-14 13:53:03,421 INFO L125 PetriNetUnfolderBase]: For 5896/5896 co-relation queries the response was YES. [2024-06-14 13:53:03,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 464 events. 261/464 cut-off events. For 5896/5896 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1674 event pairs, 76 based on Foata normal form. 1/464 useless extension candidates. Maximal degree in co-relation 2239. Up to 417 conditions per place. [2024-06-14 13:53:03,425 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 53 selfloop transitions, 15 changer transitions 0/70 dead transitions. [2024-06-14 13:53:03,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 585 flow [2024-06-14 13:53:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:53:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:53:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 13:53:03,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.341991341991342 [2024-06-14 13:53:03,427 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 417 flow. Second operand 7 states and 79 transitions. [2024-06-14 13:53:03,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 585 flow [2024-06-14 13:53:03,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 541 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 13:53:03,434 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 411 flow [2024-06-14 13:53:03,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-06-14 13:53:03,435 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2024-06-14 13:53:03,435 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 411 flow [2024-06-14 13:53:03,435 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 13:53:03,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:03,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 13:53:03,436 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 13:53:03,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 955104461, now seen corresponding path program 1 times [2024-06-14 13:53:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568006151] [2024-06-14 13:53:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568006151] [2024-06-14 13:53:07,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568006151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:07,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:07,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:53:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147280983] [2024-06-14 13:53:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:07,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:53:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:07,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:53:07,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:53:07,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:07,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 411 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 13:53:07,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:07,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:07,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:08,174 INFO L124 PetriNetUnfolderBase]: 267/475 cut-off events. [2024-06-14 13:53:08,174 INFO L125 PetriNetUnfolderBase]: For 6650/6653 co-relation queries the response was YES. [2024-06-14 13:53:08,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 475 events. 267/475 cut-off events. For 6650/6653 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1725 event pairs, 79 based on Foata normal form. 4/477 useless extension candidates. Maximal degree in co-relation 2301. Up to 425 conditions per place. [2024-06-14 13:53:08,179 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 58 selfloop transitions, 14 changer transitions 0/74 dead transitions. [2024-06-14 13:53:08,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 74 transitions, 609 flow [2024-06-14 13:53:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:53:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:53:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 13:53:08,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 13:53:08,180 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 411 flow. Second operand 8 states and 88 transitions. [2024-06-14 13:53:08,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 74 transitions, 609 flow [2024-06-14 13:53:08,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 559 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 13:53:08,188 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 414 flow [2024-06-14 13:53:08,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=414, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2024-06-14 13:53:08,189 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-14 13:53:08,189 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 414 flow [2024-06-14 13:53:08,189 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 13:53:08,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:08,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:08,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 13:53:08,189 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 13:53:08,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1228580435, now seen corresponding path program 3 times [2024-06-14 13:53:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:08,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640704589] [2024-06-14 13:53:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:13,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:13,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640704589] [2024-06-14 13:53:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640704589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:13,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:53:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296637397] [2024-06-14 13:53:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:13,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:53:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:53:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:53:13,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:53:13,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 414 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:53:13,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:13,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:53:13,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:13,489 INFO L124 PetriNetUnfolderBase]: 244/451 cut-off events. [2024-06-14 13:53:13,489 INFO L125 PetriNetUnfolderBase]: For 7199/7202 co-relation queries the response was YES. [2024-06-14 13:53:13,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 451 events. 244/451 cut-off events. For 7199/7202 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1691 event pairs, 65 based on Foata normal form. 2/450 useless extension candidates. Maximal degree in co-relation 2234. Up to 338 conditions per place. [2024-06-14 13:53:13,493 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 47 selfloop transitions, 19 changer transitions 0/74 dead transitions. [2024-06-14 13:53:13,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 74 transitions, 596 flow [2024-06-14 13:53:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 13:53:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 13:53:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 13:53:13,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3852813852813853 [2024-06-14 13:53:13,494 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 414 flow. Second operand 7 states and 89 transitions. [2024-06-14 13:53:13,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 74 transitions, 596 flow [2024-06-14 13:53:13,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 74 transitions, 559 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 13:53:13,502 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 444 flow [2024-06-14 13:53:13,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2024-06-14 13:53:13,503 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2024-06-14 13:53:13,503 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 444 flow [2024-06-14 13:53:13,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:53:13,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:13,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:13,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 13:53:13,504 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 13:53:13,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1220290911, now seen corresponding path program 2 times [2024-06-14 13:53:13,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:13,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850596070] [2024-06-14 13:53:13,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:13,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:17,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:17,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850596070] [2024-06-14 13:53:17,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850596070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:17,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:53:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673836930] [2024-06-14 13:53:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:17,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:53:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:17,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:53:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:53:17,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:17,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 444 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 13:53:17,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:17,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:17,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:17,946 INFO L124 PetriNetUnfolderBase]: 269/480 cut-off events. [2024-06-14 13:53:17,946 INFO L125 PetriNetUnfolderBase]: For 7992/7995 co-relation queries the response was YES. [2024-06-14 13:53:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 480 events. 269/480 cut-off events. For 7992/7995 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1760 event pairs, 76 based on Foata normal form. 4/481 useless extension candidates. Maximal degree in co-relation 2421. Up to 371 conditions per place. [2024-06-14 13:53:17,950 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 47 selfloop transitions, 30 changer transitions 0/79 dead transitions. [2024-06-14 13:53:17,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 712 flow [2024-06-14 13:53:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:53:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:53:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-14 13:53:17,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3446969696969697 [2024-06-14 13:53:17,952 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 444 flow. Second operand 8 states and 91 transitions. [2024-06-14 13:53:17,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 712 flow [2024-06-14 13:53:17,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 661 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 13:53:17,959 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 502 flow [2024-06-14 13:53:17,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=502, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2024-06-14 13:53:17,960 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 48 predicate places. [2024-06-14 13:53:17,960 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 502 flow [2024-06-14 13:53:17,960 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 13:53:17,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:17,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:17,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 13:53:17,961 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 13:53:17,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1220299281, now seen corresponding path program 3 times [2024-06-14 13:53:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117197238] [2024-06-14 13:53:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:21,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:21,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117197238] [2024-06-14 13:53:21,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117197238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:21,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:21,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:53:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173209616] [2024-06-14 13:53:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:21,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:53:21,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:53:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:53:22,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:22,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 502 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 13:53:22,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:22,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:22,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:22,425 INFO L124 PetriNetUnfolderBase]: 275/490 cut-off events. [2024-06-14 13:53:22,425 INFO L125 PetriNetUnfolderBase]: For 8823/8826 co-relation queries the response was YES. [2024-06-14 13:53:22,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 490 events. 275/490 cut-off events. For 8823/8826 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1817 event pairs, 76 based on Foata normal form. 4/491 useless extension candidates. Maximal degree in co-relation 2543. Up to 377 conditions per place. [2024-06-14 13:53:22,431 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 50 selfloop transitions, 29 changer transitions 0/81 dead transitions. [2024-06-14 13:53:22,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 81 transitions, 760 flow [2024-06-14 13:53:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:53:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:53:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-14 13:53:22,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-14 13:53:22,433 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 502 flow. Second operand 8 states and 92 transitions. [2024-06-14 13:53:22,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 81 transitions, 760 flow [2024-06-14 13:53:22,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 81 transitions, 706 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-14 13:53:22,450 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 535 flow [2024-06-14 13:53:22,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=535, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-06-14 13:53:22,451 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 52 predicate places. [2024-06-14 13:53:22,451 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 535 flow [2024-06-14 13:53:22,452 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 13:53:22,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:22,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:22,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 13:53:22,452 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 13:53:22,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1228573491, now seen corresponding path program 4 times [2024-06-14 13:53:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562950200] [2024-06-14 13:53:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:26,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562950200] [2024-06-14 13:53:26,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562950200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:26,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:53:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808940740] [2024-06-14 13:53:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:26,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:53:26,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:26,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:53:26,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:53:26,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:26,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 535 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 13:53:26,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:26,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:26,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:26,916 INFO L124 PetriNetUnfolderBase]: 276/492 cut-off events. [2024-06-14 13:53:26,917 INFO L125 PetriNetUnfolderBase]: For 9373/9376 co-relation queries the response was YES. [2024-06-14 13:53:26,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2654 conditions, 492 events. 276/492 cut-off events. For 9373/9376 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1824 event pairs, 85 based on Foata normal form. 4/493 useless extension candidates. Maximal degree in co-relation 2612. Up to 380 conditions per place. [2024-06-14 13:53:26,919 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 52 selfloop transitions, 29 changer transitions 0/83 dead transitions. [2024-06-14 13:53:26,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 799 flow [2024-06-14 13:53:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:53:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:53:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 13:53:26,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 13:53:26,922 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 535 flow. Second operand 8 states and 93 transitions. [2024-06-14 13:53:26,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 83 transitions, 799 flow [2024-06-14 13:53:26,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 83 transitions, 744 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 13:53:26,931 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 567 flow [2024-06-14 13:53:26,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=567, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2024-06-14 13:53:26,932 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2024-06-14 13:53:26,932 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 567 flow [2024-06-14 13:53:26,932 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 13:53:26,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:26,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:26,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 13:53:26,933 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 13:53:26,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1219991699, now seen corresponding path program 1 times [2024-06-14 13:53:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005833222] [2024-06-14 13:53:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:32,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:32,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005833222] [2024-06-14 13:53:32,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005833222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:32,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:32,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:53:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241392865] [2024-06-14 13:53:32,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:32,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:53:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:53:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:53:32,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:32,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 567 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 13:53:32,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:32,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:32,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:32,525 INFO L124 PetriNetUnfolderBase]: 274/487 cut-off events. [2024-06-14 13:53:32,525 INFO L125 PetriNetUnfolderBase]: For 9738/9738 co-relation queries the response was YES. [2024-06-14 13:53:32,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 487 events. 274/487 cut-off events. For 9738/9738 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1802 event pairs, 81 based on Foata normal form. 1/487 useless extension candidates. Maximal degree in co-relation 2615. Up to 463 conditions per place. [2024-06-14 13:53:32,528 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 65 selfloop transitions, 14 changer transitions 0/81 dead transitions. [2024-06-14 13:53:32,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 81 transitions, 759 flow [2024-06-14 13:53:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:53:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:53:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-14 13:53:32,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2996632996632997 [2024-06-14 13:53:32,529 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 567 flow. Second operand 9 states and 89 transitions. [2024-06-14 13:53:32,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 81 transitions, 759 flow [2024-06-14 13:53:32,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 81 transitions, 707 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 13:53:32,536 INFO L231 Difference]: Finished difference. Result has 91 places, 72 transitions, 566 flow [2024-06-14 13:53:32,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=566, PETRI_PLACES=91, PETRI_TRANSITIONS=72} [2024-06-14 13:53:32,537 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2024-06-14 13:53:32,537 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 566 flow [2024-06-14 13:53:32,537 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 13:53:32,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:32,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:32,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 13:53:32,538 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 13:53:32,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1378533618, now seen corresponding path program 1 times [2024-06-14 13:53:32,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:32,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112394145] [2024-06-14 13:53:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:32,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:36,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112394145] [2024-06-14 13:53:36,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112394145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:36,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:36,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:53:36,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799454529] [2024-06-14 13:53:36,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:36,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:53:36,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:36,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:53:36,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:53:37,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:37,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 72 transitions, 566 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 13:53:37,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:37,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:37,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:37,398 INFO L124 PetriNetUnfolderBase]: 280/497 cut-off events. [2024-06-14 13:53:37,399 INFO L125 PetriNetUnfolderBase]: For 10613/10613 co-relation queries the response was YES. [2024-06-14 13:53:37,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2714 conditions, 497 events. 280/497 cut-off events. For 10613/10613 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1833 event pairs, 62 based on Foata normal form. 2/498 useless extension candidates. Maximal degree in co-relation 2670. Up to 436 conditions per place. [2024-06-14 13:53:37,403 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 76 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2024-06-14 13:53:37,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 802 flow [2024-06-14 13:53:37,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:53:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:53:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-14 13:53:37,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3446969696969697 [2024-06-14 13:53:37,409 INFO L175 Difference]: Start difference. First operand has 91 places, 72 transitions, 566 flow. Second operand 8 states and 91 transitions. [2024-06-14 13:53:37,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 802 flow [2024-06-14 13:53:37,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 767 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 13:53:37,420 INFO L231 Difference]: Finished difference. Result has 92 places, 74 transitions, 584 flow [2024-06-14 13:53:37,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=584, PETRI_PLACES=92, PETRI_TRANSITIONS=74} [2024-06-14 13:53:37,420 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 60 predicate places. [2024-06-14 13:53:37,420 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 74 transitions, 584 flow [2024-06-14 13:53:37,421 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 13:53:37,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:37,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:37,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 13:53:37,421 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 13:53:37,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -600636960, now seen corresponding path program 2 times [2024-06-14 13:53:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:37,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392940524] [2024-06-14 13:53:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:42,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:42,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392940524] [2024-06-14 13:53:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392940524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:42,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:42,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:53:42,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269456195] [2024-06-14 13:53:42,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:42,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:53:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:42,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:53:42,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:53:42,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:42,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 74 transitions, 584 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 13:53:42,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:42,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:42,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:43,133 INFO L124 PetriNetUnfolderBase]: 296/523 cut-off events. [2024-06-14 13:53:43,134 INFO L125 PetriNetUnfolderBase]: For 12182/12182 co-relation queries the response was YES. [2024-06-14 13:53:43,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 523 events. 296/523 cut-off events. For 12182/12182 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1961 event pairs, 59 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 2910. Up to 415 conditions per place. [2024-06-14 13:53:43,138 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 70 selfloop transitions, 23 changer transitions 0/95 dead transitions. [2024-06-14 13:53:43,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 902 flow [2024-06-14 13:53:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:53:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:53:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 13:53:43,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2024-06-14 13:53:43,140 INFO L175 Difference]: Start difference. First operand has 92 places, 74 transitions, 584 flow. Second operand 8 states and 95 transitions. [2024-06-14 13:53:43,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 902 flow [2024-06-14 13:53:43,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 865 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 13:53:43,150 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 646 flow [2024-06-14 13:53:43,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=646, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2024-06-14 13:53:43,150 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-14 13:53:43,151 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 646 flow [2024-06-14 13:53:43,151 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 13:53:43,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:43,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:43,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 13:53:43,151 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 13:53:43,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1878549785, now seen corresponding path program 1 times [2024-06-14 13:53:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614900843] [2024-06-14 13:53:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:47,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614900843] [2024-06-14 13:53:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614900843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:47,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:47,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:53:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43501989] [2024-06-14 13:53:47,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:47,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:53:47,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:47,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:53:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:53:47,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:47,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 646 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 13:53:47,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:47,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:47,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:48,276 INFO L124 PetriNetUnfolderBase]: 294/520 cut-off events. [2024-06-14 13:53:48,276 INFO L125 PetriNetUnfolderBase]: For 12763/12763 co-relation queries the response was YES. [2024-06-14 13:53:48,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3002 conditions, 520 events. 294/520 cut-off events. For 12763/12763 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1953 event pairs, 77 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 2956. Up to 462 conditions per place. [2024-06-14 13:53:48,281 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 71 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2024-06-14 13:53:48,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 864 flow [2024-06-14 13:53:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:53:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:53:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 13:53:48,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 13:53:48,283 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 646 flow. Second operand 8 states and 88 transitions. [2024-06-14 13:53:48,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 864 flow [2024-06-14 13:53:48,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 92 transitions, 816 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 13:53:48,298 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 644 flow [2024-06-14 13:53:48,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-06-14 13:53:48,299 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 66 predicate places. [2024-06-14 13:53:48,299 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 644 flow [2024-06-14 13:53:48,299 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 13:53:48,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:48,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:48,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 13:53:48,300 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 13:53:48,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash -600631380, now seen corresponding path program 3 times [2024-06-14 13:53:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418912753] [2024-06-14 13:53:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:48,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:52,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:52,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418912753] [2024-06-14 13:53:52,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418912753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:52,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:53:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14250498] [2024-06-14 13:53:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:52,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:53:52,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:52,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:53:52,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:53:53,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:53,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 644 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 13:53:53,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:53,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:53,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:53,517 INFO L124 PetriNetUnfolderBase]: 290/514 cut-off events. [2024-06-14 13:53:53,518 INFO L125 PetriNetUnfolderBase]: For 13288/13288 co-relation queries the response was YES. [2024-06-14 13:53:53,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2969 conditions, 514 events. 290/514 cut-off events. For 13288/13288 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1922 event pairs, 55 based on Foata normal form. 2/515 useless extension candidates. Maximal degree in co-relation 2921. Up to 409 conditions per place. [2024-06-14 13:53:53,521 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 69 selfloop transitions, 24 changer transitions 0/95 dead transitions. [2024-06-14 13:53:53,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 95 transitions, 872 flow [2024-06-14 13:53:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:53:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:53:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 13:53:53,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-14 13:53:53,522 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 644 flow. Second operand 8 states and 94 transitions. [2024-06-14 13:53:53,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 95 transitions, 872 flow [2024-06-14 13:53:53,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 95 transitions, 778 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 13:53:53,537 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 604 flow [2024-06-14 13:53:53,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=604, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2024-06-14 13:53:53,537 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2024-06-14 13:53:53,537 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 604 flow [2024-06-14 13:53:53,538 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 13:53:53,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:53,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:53,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 13:53:53,538 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 13:53:53,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1230708692, now seen corresponding path program 1 times [2024-06-14 13:53:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321730011] [2024-06-14 13:53:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:53:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:57,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:53:57,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321730011] [2024-06-14 13:53:57,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321730011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:53:57,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:53:57,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:53:57,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083983492] [2024-06-14 13:53:57,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:53:57,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:53:57,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:57,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:53:57,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:53:57,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:53:57,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 604 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 13:53:57,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:57,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:53:57,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:58,378 INFO L124 PetriNetUnfolderBase]: 296/525 cut-off events. [2024-06-14 13:53:58,378 INFO L125 PetriNetUnfolderBase]: For 14156/14159 co-relation queries the response was YES. [2024-06-14 13:53:58,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3023 conditions, 525 events. 296/525 cut-off events. For 14156/14159 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1970 event pairs, 79 based on Foata normal form. 4/527 useless extension candidates. Maximal degree in co-relation 2974. Up to 467 conditions per place. [2024-06-14 13:53:58,381 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 78 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-14 13:53:58,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 96 transitions, 856 flow [2024-06-14 13:53:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:53:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:53:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 13:53:58,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3265993265993266 [2024-06-14 13:53:58,382 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 604 flow. Second operand 9 states and 97 transitions. [2024-06-14 13:53:58,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 96 transitions, 856 flow [2024-06-14 13:53:58,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 802 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 13:53:58,394 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 611 flow [2024-06-14 13:53:58,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=611, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2024-06-14 13:53:58,395 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2024-06-14 13:53:58,395 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 611 flow [2024-06-14 13:53:58,395 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 13:53:58,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:53:58,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:53:58,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 13:53:58,395 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 13:53:58,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:53:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 568719374, now seen corresponding path program 4 times [2024-06-14 13:53:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:53:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339194403] [2024-06-14 13:53:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:53:58,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:53:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:02,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:02,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339194403] [2024-06-14 13:54:02,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339194403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:02,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:02,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:54:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537412869] [2024-06-14 13:54:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:02,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:54:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:54:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:54:02,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:02,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 611 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 13:54:02,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:02,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:02,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:03,198 INFO L124 PetriNetUnfolderBase]: 312/552 cut-off events. [2024-06-14 13:54:03,199 INFO L125 PetriNetUnfolderBase]: For 16053/16056 co-relation queries the response was YES. [2024-06-14 13:54:03,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 552 events. 312/552 cut-off events. For 16053/16056 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2104 event pairs, 68 based on Foata normal form. 2/551 useless extension candidates. Maximal degree in co-relation 3208. Up to 387 conditions per place. [2024-06-14 13:54:03,201 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 70 selfloop transitions, 32 changer transitions 0/104 dead transitions. [2024-06-14 13:54:03,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 1049 flow [2024-06-14 13:54:03,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:54:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:54:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-14 13:54:03,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-14 13:54:03,202 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 611 flow. Second operand 8 states and 100 transitions. [2024-06-14 13:54:03,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 1049 flow [2024-06-14 13:54:03,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 104 transitions, 1004 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 13:54:03,215 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 717 flow [2024-06-14 13:54:03,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=717, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2024-06-14 13:54:03,216 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2024-06-14 13:54:03,216 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 717 flow [2024-06-14 13:54:03,217 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 13:54:03,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:03,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:54:03,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 13:54:03,217 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 13:54:03,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash 568713794, now seen corresponding path program 5 times [2024-06-14 13:54:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:03,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331796599] [2024-06-14 13:54:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:03,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:07,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:07,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331796599] [2024-06-14 13:54:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331796599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:07,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:07,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:54:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971316292] [2024-06-14 13:54:07,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:07,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:54:07,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:07,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:54:07,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:54:07,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:07,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 717 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 13:54:07,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:07,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:07,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:08,067 INFO L124 PetriNetUnfolderBase]: 308/546 cut-off events. [2024-06-14 13:54:08,068 INFO L125 PetriNetUnfolderBase]: For 16530/16533 co-relation queries the response was YES. [2024-06-14 13:54:08,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 546 events. 308/546 cut-off events. For 16530/16533 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2087 event pairs, 70 based on Foata normal form. 2/545 useless extension candidates. Maximal degree in co-relation 3218. Up to 384 conditions per place. [2024-06-14 13:54:08,071 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 66 selfloop transitions, 33 changer transitions 0/101 dead transitions. [2024-06-14 13:54:08,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 101 transitions, 1009 flow [2024-06-14 13:54:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:54:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:54:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 13:54:08,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 13:54:08,072 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 717 flow. Second operand 8 states and 96 transitions. [2024-06-14 13:54:08,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 101 transitions, 1009 flow [2024-06-14 13:54:08,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 921 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-14 13:54:08,088 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 700 flow [2024-06-14 13:54:08,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=700, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2024-06-14 13:54:08,089 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2024-06-14 13:54:08,089 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 700 flow [2024-06-14 13:54:08,089 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 13:54:08,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:08,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:54:08,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 13:54:08,090 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 13:54:08,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 568929120, now seen corresponding path program 2 times [2024-06-14 13:54:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306280708] [2024-06-14 13:54:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:13,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306280708] [2024-06-14 13:54:13,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306280708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:13,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:13,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:54:13,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497345825] [2024-06-14 13:54:13,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:13,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:54:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:54:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:54:13,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:13,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 700 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 13:54:13,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:13,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:13,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:13,533 INFO L124 PetriNetUnfolderBase]: 314/556 cut-off events. [2024-06-14 13:54:13,534 INFO L125 PetriNetUnfolderBase]: For 17439/17442 co-relation queries the response was YES. [2024-06-14 13:54:13,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 556 events. 314/556 cut-off events. For 17439/17442 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2129 event pairs, 85 based on Foata normal form. 4/557 useless extension candidates. Maximal degree in co-relation 3261. Up to 437 conditions per place. [2024-06-14 13:54:13,538 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 69 selfloop transitions, 31 changer transitions 0/102 dead transitions. [2024-06-14 13:54:13,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 964 flow [2024-06-14 13:54:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:54:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:54:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 13:54:13,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3400673400673401 [2024-06-14 13:54:13,539 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 700 flow. Second operand 9 states and 101 transitions. [2024-06-14 13:54:13,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 964 flow [2024-06-14 13:54:13,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 102 transitions, 900 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 13:54:13,560 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 731 flow [2024-06-14 13:54:13,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=731, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2024-06-14 13:54:13,561 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-14 13:54:13,561 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 731 flow [2024-06-14 13:54:13,561 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 13:54:13,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:13,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:54:13,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 13:54:13,562 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 13:54:13,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:13,562 INFO L85 PathProgramCache]: Analyzing trace with hash 825421694, now seen corresponding path program 6 times [2024-06-14 13:54:13,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:13,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623320986] [2024-06-14 13:54:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:13,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:18,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623320986] [2024-06-14 13:54:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623320986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:18,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:54:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648154258] [2024-06-14 13:54:18,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:18,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:54:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:54:18,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:54:18,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:18,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 731 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 13:54:18,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:18,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:18,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:18,580 INFO L124 PetriNetUnfolderBase]: 310/550 cut-off events. [2024-06-14 13:54:18,580 INFO L125 PetriNetUnfolderBase]: For 17512/17515 co-relation queries the response was YES. [2024-06-14 13:54:18,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 550 events. 310/550 cut-off events. For 17512/17515 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2121 event pairs, 63 based on Foata normal form. 2/549 useless extension candidates. Maximal degree in co-relation 3222. Up to 391 conditions per place. [2024-06-14 13:54:18,583 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 36 changer transitions 0/103 dead transitions. [2024-06-14 13:54:18,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 103 transitions, 971 flow [2024-06-14 13:54:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:54:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:54:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 13:54:18,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2024-06-14 13:54:18,584 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 731 flow. Second operand 8 states and 95 transitions. [2024-06-14 13:54:18,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 103 transitions, 971 flow [2024-06-14 13:54:18,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 103 transitions, 878 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 13:54:18,602 INFO L231 Difference]: Finished difference. Result has 108 places, 88 transitions, 715 flow [2024-06-14 13:54:18,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=715, PETRI_PLACES=108, PETRI_TRANSITIONS=88} [2024-06-14 13:54:18,603 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 76 predicate places. [2024-06-14 13:54:18,603 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 88 transitions, 715 flow [2024-06-14 13:54:18,603 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 13:54:18,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:18,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:54:18,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 13:54:18,603 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 13:54:18,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash 825429630, now seen corresponding path program 3 times [2024-06-14 13:54:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969669087] [2024-06-14 13:54:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969669087] [2024-06-14 13:54:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969669087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:54:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817567383] [2024-06-14 13:54:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:23,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:54:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:54:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:54:23,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:23,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 88 transitions, 715 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 13:54:23,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:23,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:23,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:23,927 INFO L124 PetriNetUnfolderBase]: 316/560 cut-off events. [2024-06-14 13:54:23,927 INFO L125 PetriNetUnfolderBase]: For 18574/18577 co-relation queries the response was YES. [2024-06-14 13:54:23,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3354 conditions, 560 events. 316/560 cut-off events. For 18574/18577 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2157 event pairs, 78 based on Foata normal form. 4/561 useless extension candidates. Maximal degree in co-relation 3300. Up to 441 conditions per place. [2024-06-14 13:54:23,930 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 69 selfloop transitions, 33 changer transitions 0/104 dead transitions. [2024-06-14 13:54:23,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 987 flow [2024-06-14 13:54:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:54:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:54:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-14 13:54:23,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367003367003367 [2024-06-14 13:54:23,931 INFO L175 Difference]: Start difference. First operand has 108 places, 88 transitions, 715 flow. Second operand 9 states and 100 transitions. [2024-06-14 13:54:23,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 987 flow [2024-06-14 13:54:23,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 104 transitions, 899 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 13:54:23,946 INFO L231 Difference]: Finished difference. Result has 109 places, 90 transitions, 730 flow [2024-06-14 13:54:23,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=730, PETRI_PLACES=109, PETRI_TRANSITIONS=90} [2024-06-14 13:54:23,946 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2024-06-14 13:54:23,946 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 90 transitions, 730 flow [2024-06-14 13:54:23,947 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 13:54:23,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:23,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:54:23,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 13:54:23,947 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 13:54:23,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash 834626400, now seen corresponding path program 4 times [2024-06-14 13:54:23,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:23,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718604111] [2024-06-14 13:54:23,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:23,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:28,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718604111] [2024-06-14 13:54:28,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718604111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:28,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:28,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:54:28,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320151262] [2024-06-14 13:54:28,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:28,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:54:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:28,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:54:28,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:54:28,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:28,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 90 transitions, 730 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 13:54:28,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:28,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:28,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:29,215 INFO L124 PetriNetUnfolderBase]: 322/570 cut-off events. [2024-06-14 13:54:29,215 INFO L125 PetriNetUnfolderBase]: For 19675/19678 co-relation queries the response was YES. [2024-06-14 13:54:29,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3453 conditions, 570 events. 322/570 cut-off events. For 19675/19678 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2211 event pairs, 78 based on Foata normal form. 4/571 useless extension candidates. Maximal degree in co-relation 3398. Up to 451 conditions per place. [2024-06-14 13:54:29,219 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 68 selfloop transitions, 36 changer transitions 0/106 dead transitions. [2024-06-14 13:54:29,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 106 transitions, 1010 flow [2024-06-14 13:54:29,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:54:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:54:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 13:54:29,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 13:54:29,220 INFO L175 Difference]: Start difference. First operand has 109 places, 90 transitions, 730 flow. Second operand 9 states and 99 transitions. [2024-06-14 13:54:29,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 106 transitions, 1010 flow [2024-06-14 13:54:29,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 106 transitions, 923 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 13:54:29,237 INFO L231 Difference]: Finished difference. Result has 111 places, 92 transitions, 756 flow [2024-06-14 13:54:29,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=756, PETRI_PLACES=111, PETRI_TRANSITIONS=92} [2024-06-14 13:54:29,238 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2024-06-14 13:54:29,238 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 92 transitions, 756 flow [2024-06-14 13:54:29,238 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 13:54:29,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:29,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:54:29,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 13:54:29,238 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 13:54:29,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 834952830, now seen corresponding path program 5 times [2024-06-14 13:54:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779086478] [2024-06-14 13:54:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:33,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:33,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779086478] [2024-06-14 13:54:33,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779086478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:33,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:33,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:54:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033748206] [2024-06-14 13:54:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:33,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:54:33,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:33,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:54:33,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:54:33,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:33,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 92 transitions, 756 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 13:54:33,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:33,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:33,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:33,674 INFO L124 PetriNetUnfolderBase]: 339/596 cut-off events. [2024-06-14 13:54:33,674 INFO L125 PetriNetUnfolderBase]: For 22517/22517 co-relation queries the response was YES. [2024-06-14 13:54:33,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 596 events. 339/596 cut-off events. For 22517/22517 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2333 event pairs, 88 based on Foata normal form. 4/599 useless extension candidates. Maximal degree in co-relation 3636. Up to 549 conditions per place. [2024-06-14 13:54:33,677 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 89 selfloop transitions, 18 changer transitions 0/109 dead transitions. [2024-06-14 13:54:33,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 1136 flow [2024-06-14 13:54:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:54:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:54:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-14 13:54:33,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31986531986531985 [2024-06-14 13:54:33,680 INFO L175 Difference]: Start difference. First operand has 111 places, 92 transitions, 756 flow. Second operand 9 states and 95 transitions. [2024-06-14 13:54:33,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 1136 flow [2024-06-14 13:54:33,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 1039 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 13:54:33,707 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 776 flow [2024-06-14 13:54:33,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=776, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2024-06-14 13:54:33,707 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2024-06-14 13:54:33,708 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 776 flow [2024-06-14 13:54:33,708 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 13:54:33,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:33,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:54:33,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 13:54:33,708 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 13:54:33,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 834964734, now seen corresponding path program 1 times [2024-06-14 13:54:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318507182] [2024-06-14 13:54:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:39,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318507182] [2024-06-14 13:54:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318507182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:39,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:39,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:54:39,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240933521] [2024-06-14 13:54:39,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:39,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:54:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:54:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:54:39,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:39,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 776 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 13:54:39,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:39,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:39,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:39,701 INFO L124 PetriNetUnfolderBase]: 336/591 cut-off events. [2024-06-14 13:54:39,701 INFO L125 PetriNetUnfolderBase]: For 21284/21284 co-relation queries the response was YES. [2024-06-14 13:54:39,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 591 events. 336/591 cut-off events. For 21284/21284 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2297 event pairs, 90 based on Foata normal form. 2/592 useless extension candidates. Maximal degree in co-relation 3559. Up to 561 conditions per place. [2024-06-14 13:54:39,704 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 91 selfloop transitions, 15 changer transitions 0/108 dead transitions. [2024-06-14 13:54:39,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 108 transitions, 1012 flow [2024-06-14 13:54:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:54:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:54:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2024-06-14 13:54:39,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2024-06-14 13:54:39,706 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 776 flow. Second operand 10 states and 96 transitions. [2024-06-14 13:54:39,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 108 transitions, 1012 flow [2024-06-14 13:54:39,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 108 transitions, 958 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-14 13:54:39,736 INFO L231 Difference]: Finished difference. Result has 118 places, 97 transitions, 756 flow [2024-06-14 13:54:39,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=756, PETRI_PLACES=118, PETRI_TRANSITIONS=97} [2024-06-14 13:54:39,737 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-14 13:54:39,737 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 756 flow [2024-06-14 13:54:39,737 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 13:54:39,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:39,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:54:39,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 13:54:39,738 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 13:54:39,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1555289170, now seen corresponding path program 1 times [2024-06-14 13:54:39,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:39,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540073255] [2024-06-14 13:54:39,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:39,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:44,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:44,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540073255] [2024-06-14 13:54:44,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540073255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:44,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:44,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:54:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078805811] [2024-06-14 13:54:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:44,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:54:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:44,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:54:44,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:54:45,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 13:54:45,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 756 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:54:45,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:45,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 13:54:45,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:45,353 INFO L124 PetriNetUnfolderBase]: 311/566 cut-off events. [2024-06-14 13:54:45,353 INFO L125 PetriNetUnfolderBase]: For 22649/22653 co-relation queries the response was YES. [2024-06-14 13:54:45,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 566 events. 311/566 cut-off events. For 22649/22653 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2311 event pairs, 43 based on Foata normal form. 2/563 useless extension candidates. Maximal degree in co-relation 3444. Up to 459 conditions per place. [2024-06-14 13:54:45,357 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 90 selfloop transitions, 11 changer transitions 0/115 dead transitions. [2024-06-14 13:54:45,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 115 transitions, 1012 flow [2024-06-14 13:54:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:54:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:54:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 13:54:45,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-14 13:54:45,365 INFO L175 Difference]: Start difference. First operand has 118 places, 97 transitions, 756 flow. Second operand 8 states and 103 transitions. [2024-06-14 13:54:45,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 115 transitions, 1012 flow [2024-06-14 13:54:45,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 115 transitions, 972 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 13:54:45,395 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 758 flow [2024-06-14 13:54:45,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=758, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2024-06-14 13:54:45,396 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-14 13:54:45,396 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 758 flow [2024-06-14 13:54:45,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:54:45,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:45,396 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 13:54:45,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 13:54:45,396 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 13:54:45,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash 212330978, now seen corresponding path program 2 times [2024-06-14 13:54:45,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:45,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149808923] [2024-06-14 13:54:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:45,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:50,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149808923] [2024-06-14 13:54:50,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149808923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:50,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:50,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 13:54:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711409861] [2024-06-14 13:54:50,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:50,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 13:54:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:50,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 13:54:50,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 13:54:50,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 13:54:50,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 758 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:54:50,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:50,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 13:54:50,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:51,235 INFO L124 PetriNetUnfolderBase]: 315/574 cut-off events. [2024-06-14 13:54:51,235 INFO L125 PetriNetUnfolderBase]: For 23935/23939 co-relation queries the response was YES. [2024-06-14 13:54:51,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3571 conditions, 574 events. 315/574 cut-off events. For 23935/23939 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2352 event pairs, 60 based on Foata normal form. 2/571 useless extension candidates. Maximal degree in co-relation 3511. Up to 479 conditions per place. [2024-06-14 13:54:51,240 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 90 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2024-06-14 13:54:51,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 116 transitions, 1018 flow [2024-06-14 13:54:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:54:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:54:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 13:54:51,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 13:54:51,253 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 758 flow. Second operand 8 states and 105 transitions. [2024-06-14 13:54:51,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 116 transitions, 1018 flow [2024-06-14 13:54:51,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 986 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 13:54:51,284 INFO L231 Difference]: Finished difference. Result has 120 places, 99 transitions, 772 flow [2024-06-14 13:54:51,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=120, PETRI_TRANSITIONS=99} [2024-06-14 13:54:51,285 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-14 13:54:51,285 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 99 transitions, 772 flow [2024-06-14 13:54:51,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:54:51,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:51,286 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 13:54:51,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 13:54:51,286 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 13:54:51,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1555166100, now seen corresponding path program 1 times [2024-06-14 13:54:51,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772035893] [2024-06-14 13:54:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:54:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:54:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:54:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772035893] [2024-06-14 13:54:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772035893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:54:56,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:54:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:54:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798410685] [2024-06-14 13:54:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:54:56,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:54:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:54:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:54:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:54:56,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:54:56,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 99 transitions, 772 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 13:54:56,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:54:56,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:54:56,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:54:56,652 INFO L124 PetriNetUnfolderBase]: 350/617 cut-off events. [2024-06-14 13:54:56,652 INFO L125 PetriNetUnfolderBase]: For 25316/25316 co-relation queries the response was YES. [2024-06-14 13:54:56,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3781 conditions, 617 events. 350/617 cut-off events. For 25316/25316 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2460 event pairs, 70 based on Foata normal form. 2/618 useless extension candidates. Maximal degree in co-relation 3720. Up to 548 conditions per place. [2024-06-14 13:54:56,656 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 103 selfloop transitions, 15 changer transitions 0/120 dead transitions. [2024-06-14 13:54:56,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 120 transitions, 1074 flow [2024-06-14 13:54:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:54:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:54:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-14 13:54:56,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367003367003367 [2024-06-14 13:54:56,657 INFO L175 Difference]: Start difference. First operand has 120 places, 99 transitions, 772 flow. Second operand 9 states and 100 transitions. [2024-06-14 13:54:56,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 120 transitions, 1074 flow [2024-06-14 13:54:56,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 1038 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 13:54:56,686 INFO L231 Difference]: Finished difference. Result has 123 places, 101 transitions, 797 flow [2024-06-14 13:54:56,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=797, PETRI_PLACES=123, PETRI_TRANSITIONS=101} [2024-06-14 13:54:56,686 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 91 predicate places. [2024-06-14 13:54:56,686 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 101 transitions, 797 flow [2024-06-14 13:54:56,686 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 13:54:56,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:54:56,686 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 13:54:56,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 13:54:56,687 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 13:54:56,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:54:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1439879890, now seen corresponding path program 3 times [2024-06-14 13:54:56,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:54:56,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183520705] [2024-06-14 13:54:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:54:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:54:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183520705] [2024-06-14 13:55:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183520705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:55:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107323117] [2024-06-14 13:55:02,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:02,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:55:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:55:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:55:02,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:55:02,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 101 transitions, 797 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:55:02,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:02,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:55:02,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:02,896 INFO L124 PetriNetUnfolderBase]: 322/591 cut-off events. [2024-06-14 13:55:02,897 INFO L125 PetriNetUnfolderBase]: For 26816/26818 co-relation queries the response was YES. [2024-06-14 13:55:02,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 591 events. 322/591 cut-off events. For 26816/26818 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2467 event pairs, 53 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 3684. Up to 477 conditions per place. [2024-06-14 13:55:02,901 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 87 selfloop transitions, 17 changer transitions 0/118 dead transitions. [2024-06-14 13:55:02,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 118 transitions, 1061 flow [2024-06-14 13:55:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:55:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:55:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 13:55:02,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2024-06-14 13:55:02,905 INFO L175 Difference]: Start difference. First operand has 123 places, 101 transitions, 797 flow. Second operand 8 states and 98 transitions. [2024-06-14 13:55:02,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 118 transitions, 1061 flow [2024-06-14 13:55:02,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 1016 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 13:55:02,945 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 810 flow [2024-06-14 13:55:02,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=810, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2024-06-14 13:55:02,945 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2024-06-14 13:55:02,945 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 102 transitions, 810 flow [2024-06-14 13:55:02,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:55:02,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:02,946 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 13:55:02,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 13:55:02,946 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 13:55:02,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1439874930, now seen corresponding path program 2 times [2024-06-14 13:55:02,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:02,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42803034] [2024-06-14 13:55:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:02,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42803034] [2024-06-14 13:55:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42803034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:55:08,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750405025] [2024-06-14 13:55:08,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:08,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:55:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:55:08,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:55:08,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:55:08,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 102 transitions, 810 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 13:55:08,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:08,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:55:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:09,095 INFO L124 PetriNetUnfolderBase]: 370/651 cut-off events. [2024-06-14 13:55:09,095 INFO L125 PetriNetUnfolderBase]: For 29819/29819 co-relation queries the response was YES. [2024-06-14 13:55:09,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4112 conditions, 651 events. 370/651 cut-off events. For 29819/29819 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2647 event pairs, 65 based on Foata normal form. 2/652 useless extension candidates. Maximal degree in co-relation 4049. Up to 504 conditions per place. [2024-06-14 13:55:09,099 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 94 selfloop transitions, 29 changer transitions 0/125 dead transitions. [2024-06-14 13:55:09,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 125 transitions, 1232 flow [2024-06-14 13:55:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:55:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:55:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 13:55:09,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-14 13:55:09,100 INFO L175 Difference]: Start difference. First operand has 124 places, 102 transitions, 810 flow. Second operand 9 states and 106 transitions. [2024-06-14 13:55:09,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 125 transitions, 1232 flow [2024-06-14 13:55:09,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 125 transitions, 1184 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 13:55:09,133 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 881 flow [2024-06-14 13:55:09,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=118, 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=881, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2024-06-14 13:55:09,134 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-14 13:55:09,134 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 881 flow [2024-06-14 13:55:09,134 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 13:55:09,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:09,134 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 13:55:09,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 13:55:09,134 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 13:55:09,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:09,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1439695192, now seen corresponding path program 1 times [2024-06-14 13:55:09,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:09,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743720251] [2024-06-14 13:55:09,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:09,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:14,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:14,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743720251] [2024-06-14 13:55:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743720251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:55:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653673378] [2024-06-14 13:55:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:14,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:55:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:55:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:55:14,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:55:14,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 881 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 13:55:14,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:14,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:55:14,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:14,889 INFO L124 PetriNetUnfolderBase]: 368/648 cut-off events. [2024-06-14 13:55:14,889 INFO L125 PetriNetUnfolderBase]: For 29644/29644 co-relation queries the response was YES. [2024-06-14 13:55:14,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4117 conditions, 648 events. 368/648 cut-off events. For 29644/29644 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2637 event pairs, 84 based on Foata normal form. 1/648 useless extension candidates. Maximal degree in co-relation 4053. Up to 579 conditions per place. [2024-06-14 13:55:14,894 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 99 selfloop transitions, 23 changer transitions 0/124 dead transitions. [2024-06-14 13:55:14,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 124 transitions, 1209 flow [2024-06-14 13:55:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:55:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:55:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 13:55:14,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3265993265993266 [2024-06-14 13:55:14,895 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 881 flow. Second operand 9 states and 97 transitions. [2024-06-14 13:55:14,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 124 transitions, 1209 flow [2024-06-14 13:55:14,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 124 transitions, 1157 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 13:55:14,930 INFO L231 Difference]: Finished difference. Result has 131 places, 108 transitions, 927 flow [2024-06-14 13:55:14,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=927, PETRI_PLACES=131, PETRI_TRANSITIONS=108} [2024-06-14 13:55:14,931 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 99 predicate places. [2024-06-14 13:55:14,931 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 108 transitions, 927 flow [2024-06-14 13:55:14,932 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 13:55:14,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:14,932 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 13:55:14,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 13:55:14,933 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 13:55:14,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash 330596598, now seen corresponding path program 3 times [2024-06-14 13:55:14,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:14,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857139979] [2024-06-14 13:55:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:19,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857139979] [2024-06-14 13:55:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857139979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:55:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698198707] [2024-06-14 13:55:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:19,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:55:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:55:19,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:55:19,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:55:19,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 108 transitions, 927 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 13:55:19,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:19,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:55:19,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:20,202 INFO L124 PetriNetUnfolderBase]: 374/658 cut-off events. [2024-06-14 13:55:20,202 INFO L125 PetriNetUnfolderBase]: For 31809/31809 co-relation queries the response was YES. [2024-06-14 13:55:20,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4239 conditions, 658 events. 374/658 cut-off events. For 31809/31809 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2699 event pairs, 60 based on Foata normal form. 2/659 useless extension candidates. Maximal degree in co-relation 4173. Up to 507 conditions per place. [2024-06-14 13:55:20,207 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 96 selfloop transitions, 32 changer transitions 0/130 dead transitions. [2024-06-14 13:55:20,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 130 transitions, 1343 flow [2024-06-14 13:55:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:55:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:55:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 13:55:20,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-14 13:55:20,214 INFO L175 Difference]: Start difference. First operand has 131 places, 108 transitions, 927 flow. Second operand 9 states and 106 transitions. [2024-06-14 13:55:20,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 130 transitions, 1343 flow [2024-06-14 13:55:20,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 130 transitions, 1271 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 13:55:20,274 INFO L231 Difference]: Finished difference. Result has 133 places, 110 transitions, 952 flow [2024-06-14 13:55:20,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=952, PETRI_PLACES=133, PETRI_TRANSITIONS=110} [2024-06-14 13:55:20,275 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-14 13:55:20,275 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 110 transitions, 952 flow [2024-06-14 13:55:20,275 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 13:55:20,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:20,275 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 13:55:20,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 13:55:20,276 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 13:55:20,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 330603108, now seen corresponding path program 4 times [2024-06-14 13:55:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368152573] [2024-06-14 13:55:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:25,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 13:55:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:25,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368152573] [2024-06-14 13:55:25,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368152573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:25,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:25,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:55:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936590124] [2024-06-14 13:55:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:25,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:55:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:55:25,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:55:25,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:55:25,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 110 transitions, 952 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 13:55:25,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:25,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:55:25,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:25,686 INFO L124 PetriNetUnfolderBase]: 370/652 cut-off events. [2024-06-14 13:55:25,686 INFO L125 PetriNetUnfolderBase]: For 31682/31682 co-relation queries the response was YES. [2024-06-14 13:55:25,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4170 conditions, 652 events. 370/652 cut-off events. For 31682/31682 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2657 event pairs, 59 based on Foata normal form. 2/653 useless extension candidates. Maximal degree in co-relation 4103. Up to 504 conditions per place. [2024-06-14 13:55:25,689 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 94 selfloop transitions, 34 changer transitions 0/130 dead transitions. [2024-06-14 13:55:25,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 130 transitions, 1258 flow [2024-06-14 13:55:25,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:55:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:55:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 13:55:25,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-14 13:55:25,690 INFO L175 Difference]: Start difference. First operand has 133 places, 110 transitions, 952 flow. Second operand 9 states and 105 transitions. [2024-06-14 13:55:25,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 130 transitions, 1258 flow [2024-06-14 13:55:25,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 130 transitions, 1154 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-14 13:55:25,729 INFO L231 Difference]: Finished difference. Result has 135 places, 110 transitions, 922 flow [2024-06-14 13:55:25,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=922, PETRI_PLACES=135, PETRI_TRANSITIONS=110} [2024-06-14 13:55:25,729 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 103 predicate places. [2024-06-14 13:55:25,729 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 110 transitions, 922 flow [2024-06-14 13:55:25,729 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 13:55:25,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:25,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:55:25,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 13:55:25,730 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 13:55:25,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash 502737920, now seen corresponding path program 1 times [2024-06-14 13:55:25,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:25,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751397682] [2024-06-14 13:55:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:25,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751397682] [2024-06-14 13:55:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751397682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:31,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:55:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464318889] [2024-06-14 13:55:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:31,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:55:31,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:55:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:55:31,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:55:31,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 110 transitions, 922 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 13:55:31,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:31,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:55:31,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:32,093 INFO L124 PetriNetUnfolderBase]: 404/711 cut-off events. [2024-06-14 13:55:32,094 INFO L125 PetriNetUnfolderBase]: For 33120/33120 co-relation queries the response was YES. [2024-06-14 13:55:32,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 711 events. 404/711 cut-off events. For 33120/33120 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2978 event pairs, 91 based on Foata normal form. 2/710 useless extension candidates. Maximal degree in co-relation 4405. Up to 639 conditions per place. [2024-06-14 13:55:32,098 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 118 selfloop transitions, 21 changer transitions 0/141 dead transitions. [2024-06-14 13:55:32,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 1410 flow [2024-06-14 13:55:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 13:55:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 13:55:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-14 13:55:32,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31129476584022037 [2024-06-14 13:55:32,099 INFO L175 Difference]: Start difference. First operand has 135 places, 110 transitions, 922 flow. Second operand 11 states and 113 transitions. [2024-06-14 13:55:32,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 1410 flow [2024-06-14 13:55:32,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 141 transitions, 1323 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 13:55:32,142 INFO L231 Difference]: Finished difference. Result has 145 places, 125 transitions, 1094 flow [2024-06-14 13:55:32,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1094, PETRI_PLACES=145, PETRI_TRANSITIONS=125} [2024-06-14 13:55:32,143 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 113 predicate places. [2024-06-14 13:55:32,143 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 125 transitions, 1094 flow [2024-06-14 13:55:32,143 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 13:55:32,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:32,143 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 13:55:32,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 13:55:32,143 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 13:55:32,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1885167284, now seen corresponding path program 2 times [2024-06-14 13:55:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131544109] [2024-06-14 13:55:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:37,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131544109] [2024-06-14 13:55:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131544109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:37,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:37,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:55:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167450732] [2024-06-14 13:55:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:37,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:55:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:55:37,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:55:37,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:55:37,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 125 transitions, 1094 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 13:55:37,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:37,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:55:37,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:38,411 INFO L124 PetriNetUnfolderBase]: 410/721 cut-off events. [2024-06-14 13:55:38,411 INFO L125 PetriNetUnfolderBase]: For 34682/34682 co-relation queries the response was YES. [2024-06-14 13:55:38,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 721 events. 410/721 cut-off events. For 34682/34682 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3020 event pairs, 91 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 4545. Up to 649 conditions per place. [2024-06-14 13:55:38,416 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 121 selfloop transitions, 24 changer transitions 0/147 dead transitions. [2024-06-14 13:55:38,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 1487 flow [2024-06-14 13:55:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 13:55:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 13:55:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 13:55:38,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3168044077134986 [2024-06-14 13:55:38,417 INFO L175 Difference]: Start difference. First operand has 145 places, 125 transitions, 1094 flow. Second operand 11 states and 115 transitions. [2024-06-14 13:55:38,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 1487 flow [2024-06-14 13:55:38,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 147 transitions, 1443 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-14 13:55:38,469 INFO L231 Difference]: Finished difference. Result has 155 places, 129 transitions, 1166 flow [2024-06-14 13:55:38,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1166, PETRI_PLACES=155, PETRI_TRANSITIONS=129} [2024-06-14 13:55:38,470 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 123 predicate places. [2024-06-14 13:55:38,470 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 129 transitions, 1166 flow [2024-06-14 13:55:38,470 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 13:55:38,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:38,470 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 13:55:38,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 13:55:38,470 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 13:55:38,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash 450255116, now seen corresponding path program 4 times [2024-06-14 13:55:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:38,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55967181] [2024-06-14 13:55:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55967181] [2024-06-14 13:55:44,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55967181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:44,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:55:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387246218] [2024-06-14 13:55:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:44,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:55:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:55:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:55:44,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:55:44,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 129 transitions, 1166 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:55:44,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:44,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:55:44,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:45,066 INFO L124 PetriNetUnfolderBase]: 369/675 cut-off events. [2024-06-14 13:55:45,066 INFO L125 PetriNetUnfolderBase]: For 34204/34208 co-relation queries the response was YES. [2024-06-14 13:55:45,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4422 conditions, 675 events. 369/675 cut-off events. For 34204/34208 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2959 event pairs, 55 based on Foata normal form. 2/669 useless extension candidates. Maximal degree in co-relation 4343. Up to 526 conditions per place. [2024-06-14 13:55:45,071 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 106 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-14 13:55:45,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 143 transitions, 1458 flow [2024-06-14 13:55:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 13:55:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 13:55:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 13:55:45,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2024-06-14 13:55:45,072 INFO L175 Difference]: Start difference. First operand has 155 places, 129 transitions, 1166 flow. Second operand 8 states and 98 transitions. [2024-06-14 13:55:45,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 143 transitions, 1458 flow [2024-06-14 13:55:45,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 143 transitions, 1339 flow, removed 26 selfloop flow, removed 12 redundant places. [2024-06-14 13:55:45,129 INFO L231 Difference]: Finished difference. Result has 151 places, 129 transitions, 1095 flow [2024-06-14 13:55:45,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1095, PETRI_PLACES=151, PETRI_TRANSITIONS=129} [2024-06-14 13:55:45,130 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 119 predicate places. [2024-06-14 13:55:45,130 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 129 transitions, 1095 flow [2024-06-14 13:55:45,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 13:55:45,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:45,130 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 13:55:45,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 13:55:45,131 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 13:55:45,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:45,131 INFO L85 PathProgramCache]: Analyzing trace with hash 450439566, now seen corresponding path program 5 times [2024-06-14 13:55:45,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:45,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953345549] [2024-06-14 13:55:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:45,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:50,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953345549] [2024-06-14 13:55:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953345549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:50,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:50,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:55:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561635880] [2024-06-14 13:55:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:50,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:55:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:50,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:55:50,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:55:50,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:55:50,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 129 transitions, 1095 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 13:55:50,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:50,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:55:50,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:50,877 INFO L124 PetriNetUnfolderBase]: 423/743 cut-off events. [2024-06-14 13:55:50,877 INFO L125 PetriNetUnfolderBase]: For 37745/37745 co-relation queries the response was YES. [2024-06-14 13:55:50,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4747 conditions, 743 events. 423/743 cut-off events. For 37745/37745 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3139 event pairs, 69 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 4671. Up to 446 conditions per place. [2024-06-14 13:55:50,882 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 107 selfloop transitions, 47 changer transitions 0/156 dead transitions. [2024-06-14 13:55:50,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 156 transitions, 1735 flow [2024-06-14 13:55:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:55:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:55:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 13:55:50,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38047138047138046 [2024-06-14 13:55:50,883 INFO L175 Difference]: Start difference. First operand has 151 places, 129 transitions, 1095 flow. Second operand 9 states and 113 transitions. [2024-06-14 13:55:50,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 156 transitions, 1735 flow [2024-06-14 13:55:50,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 156 transitions, 1657 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 13:55:50,939 INFO L231 Difference]: Finished difference. Result has 153 places, 135 transitions, 1210 flow [2024-06-14 13:55:50,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1210, PETRI_PLACES=153, PETRI_TRANSITIONS=135} [2024-06-14 13:55:50,939 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 121 predicate places. [2024-06-14 13:55:50,939 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 135 transitions, 1210 flow [2024-06-14 13:55:50,939 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 13:55:50,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:50,940 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 13:55:50,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 13:55:50,940 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 13:55:50,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 450433056, now seen corresponding path program 6 times [2024-06-14 13:55:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617919827] [2024-06-14 13:55:50,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:55:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:55:56,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:55:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617919827] [2024-06-14 13:55:56,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617919827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:55:56,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:55:56,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:55:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600822219] [2024-06-14 13:55:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:55:56,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:55:56,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:55:56,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:55:56,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:55:56,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:55:56,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 135 transitions, 1210 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 13:55:56,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:55:56,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:55:56,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:55:56,732 INFO L124 PetriNetUnfolderBase]: 429/753 cut-off events. [2024-06-14 13:55:56,732 INFO L125 PetriNetUnfolderBase]: For 39348/39348 co-relation queries the response was YES. [2024-06-14 13:55:56,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4892 conditions, 753 events. 429/753 cut-off events. For 39348/39348 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3215 event pairs, 69 based on Foata normal form. 2/751 useless extension candidates. Maximal degree in co-relation 4815. Up to 452 conditions per place. [2024-06-14 13:55:56,737 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 107 selfloop transitions, 48 changer transitions 0/157 dead transitions. [2024-06-14 13:55:56,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 1796 flow [2024-06-14 13:55:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:55:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:55:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 13:55:56,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38047138047138046 [2024-06-14 13:55:56,738 INFO L175 Difference]: Start difference. First operand has 153 places, 135 transitions, 1210 flow. Second operand 9 states and 113 transitions. [2024-06-14 13:55:56,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 1796 flow [2024-06-14 13:55:56,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 157 transitions, 1676 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 13:55:56,789 INFO L231 Difference]: Finished difference. Result has 156 places, 137 transitions, 1225 flow [2024-06-14 13:55:56,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1225, PETRI_PLACES=156, PETRI_TRANSITIONS=137} [2024-06-14 13:55:56,789 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-14 13:55:56,789 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 137 transitions, 1225 flow [2024-06-14 13:55:56,789 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 13:55:56,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:55:56,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:55:56,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 13:55:56,790 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 13:55:56,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:55:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash 103607404, now seen corresponding path program 7 times [2024-06-14 13:55:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:55:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616124989] [2024-06-14 13:55:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:55:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:55:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56: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 13:56:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:01,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616124989] [2024-06-14 13:56:01,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616124989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:01,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:01,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932105895] [2024-06-14 13:56:01,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:01,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:01,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:01,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 137 transitions, 1225 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 13:56:01,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:01,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:01,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:01,804 INFO L124 PetriNetUnfolderBase]: 435/763 cut-off events. [2024-06-14 13:56:01,804 INFO L125 PetriNetUnfolderBase]: For 40828/40828 co-relation queries the response was YES. [2024-06-14 13:56:01,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 763 events. 435/763 cut-off events. For 40828/40828 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3272 event pairs, 53 based on Foata normal form. 2/761 useless extension candidates. Maximal degree in co-relation 4858. Up to 458 conditions per place. [2024-06-14 13:56:01,809 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 92 selfloop transitions, 64 changer transitions 0/158 dead transitions. [2024-06-14 13:56:01,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 158 transitions, 1719 flow [2024-06-14 13:56:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:56:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:56:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 13:56:01,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 13:56:01,811 INFO L175 Difference]: Start difference. First operand has 156 places, 137 transitions, 1225 flow. Second operand 9 states and 108 transitions. [2024-06-14 13:56:01,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 158 transitions, 1719 flow [2024-06-14 13:56:01,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 158 transitions, 1610 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 13:56:01,871 INFO L231 Difference]: Finished difference. Result has 159 places, 139 transitions, 1283 flow [2024-06-14 13:56:01,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1283, PETRI_PLACES=159, PETRI_TRANSITIONS=139} [2024-06-14 13:56:01,872 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 127 predicate places. [2024-06-14 13:56:01,872 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 139 transitions, 1283 flow [2024-06-14 13:56:01,872 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 13:56:01,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:01,872 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 13:56:01,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 13:56:01,873 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 13:56:01,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:01,873 INFO L85 PathProgramCache]: Analyzing trace with hash 113735662, now seen corresponding path program 3 times [2024-06-14 13:56:01,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:01,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344569882] [2024-06-14 13:56:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:01,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:06,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:06,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344569882] [2024-06-14 13:56:06,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344569882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:06,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:06,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:06,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5619471] [2024-06-14 13:56:06,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:06,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:06,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:06,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:06,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:06,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 139 transitions, 1283 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 13:56:06,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:06,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:06,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:07,259 INFO L124 PetriNetUnfolderBase]: 431/758 cut-off events. [2024-06-14 13:56:07,259 INFO L125 PetriNetUnfolderBase]: For 39901/39901 co-relation queries the response was YES. [2024-06-14 13:56:07,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4887 conditions, 758 events. 431/758 cut-off events. For 39901/39901 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3257 event pairs, 171 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 4809. Up to 710 conditions per place. [2024-06-14 13:56:07,263 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 129 selfloop transitions, 19 changer transitions 0/150 dead transitions. [2024-06-14 13:56:07,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 150 transitions, 1613 flow [2024-06-14 13:56:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:56:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:56:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-14 13:56:07,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3164983164983165 [2024-06-14 13:56:07,264 INFO L175 Difference]: Start difference. First operand has 159 places, 139 transitions, 1283 flow. Second operand 9 states and 94 transitions. [2024-06-14 13:56:07,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 150 transitions, 1613 flow [2024-06-14 13:56:07,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 150 transitions, 1483 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 13:56:07,328 INFO L231 Difference]: Finished difference. Result has 162 places, 139 transitions, 1200 flow [2024-06-14 13:56:07,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1200, PETRI_PLACES=162, PETRI_TRANSITIONS=139} [2024-06-14 13:56:07,329 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 130 predicate places. [2024-06-14 13:56:07,329 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 139 transitions, 1200 flow [2024-06-14 13:56:07,329 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 13:56:07,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:07,329 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 13:56:07,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 13:56:07,330 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 13:56:07,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash 450260076, now seen corresponding path program 8 times [2024-06-14 13:56:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:07,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116656334] [2024-06-14 13:56:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:11,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116656334] [2024-06-14 13:56:11,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116656334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:11,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:11,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:56:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16696871] [2024-06-14 13:56:11,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:11,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:56:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:11,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:56:11,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:56:11,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:11,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 139 transitions, 1200 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 13:56:11,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:11,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:11,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:12,299 INFO L124 PetriNetUnfolderBase]: 427/751 cut-off events. [2024-06-14 13:56:12,299 INFO L125 PetriNetUnfolderBase]: For 38615/38615 co-relation queries the response was YES. [2024-06-14 13:56:12,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4643 conditions, 751 events. 427/751 cut-off events. For 38615/38615 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3199 event pairs, 74 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 4564. Up to 449 conditions per place. [2024-06-14 13:56:12,304 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 101 selfloop transitions, 53 changer transitions 0/156 dead transitions. [2024-06-14 13:56:12,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 156 transitions, 1652 flow [2024-06-14 13:56:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:56:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:56:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 13:56:12,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 13:56:12,305 INFO L175 Difference]: Start difference. First operand has 162 places, 139 transitions, 1200 flow. Second operand 9 states and 108 transitions. [2024-06-14 13:56:12,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 156 transitions, 1652 flow [2024-06-14 13:56:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 156 transitions, 1588 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 13:56:12,366 INFO L231 Difference]: Finished difference. Result has 163 places, 139 transitions, 1249 flow [2024-06-14 13:56:12,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1249, PETRI_PLACES=163, PETRI_TRANSITIONS=139} [2024-06-14 13:56:12,367 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-14 13:56:12,367 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 139 transitions, 1249 flow [2024-06-14 13:56:12,367 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 13:56:12,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:12,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 13:56:12,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 13:56:12,367 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 13:56:12,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 456935244, now seen corresponding path program 4 times [2024-06-14 13:56:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:12,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103051369] [2024-06-14 13:56:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103051369] [2024-06-14 13:56:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103051369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117777011] [2024-06-14 13:56:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:19,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:19,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:19,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 139 transitions, 1249 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 13:56:19,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:19,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:19,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:19,633 INFO L124 PetriNetUnfolderBase]: 433/761 cut-off events. [2024-06-14 13:56:19,633 INFO L125 PetriNetUnfolderBase]: For 39002/39002 co-relation queries the response was YES. [2024-06-14 13:56:19,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 761 events. 433/761 cut-off events. For 39002/39002 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3255 event pairs, 86 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 4688. Up to 606 conditions per place. [2024-06-14 13:56:19,638 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 115 selfloop transitions, 39 changer transitions 0/156 dead transitions. [2024-06-14 13:56:19,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 156 transitions, 1639 flow [2024-06-14 13:56:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:56:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:56:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 13:56:19,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 13:56:19,639 INFO L175 Difference]: Start difference. First operand has 163 places, 139 transitions, 1249 flow. Second operand 10 states and 110 transitions. [2024-06-14 13:56:19,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 156 transitions, 1639 flow [2024-06-14 13:56:19,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 156 transitions, 1533 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 13:56:19,702 INFO L231 Difference]: Finished difference. Result has 165 places, 141 transitions, 1268 flow [2024-06-14 13:56:19,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1268, PETRI_PLACES=165, PETRI_TRANSITIONS=141} [2024-06-14 13:56:19,702 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 133 predicate places. [2024-06-14 13:56:19,703 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 141 transitions, 1268 flow [2024-06-14 13:56:19,703 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 13:56:19,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:19,703 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 13:56:19,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 13:56:19,703 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 13:56:19,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash 103616332, now seen corresponding path program 5 times [2024-06-14 13:56:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:19,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676955041] [2024-06-14 13:56:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:19,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:26,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676955041] [2024-06-14 13:56:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676955041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:26,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:26,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129016645] [2024-06-14 13:56:26,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:26,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:26,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:26,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 141 transitions, 1268 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 13:56:26,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:26,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:26,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:27,071 INFO L124 PetriNetUnfolderBase]: 439/771 cut-off events. [2024-06-14 13:56:27,071 INFO L125 PetriNetUnfolderBase]: For 40530/40530 co-relation queries the response was YES. [2024-06-14 13:56:27,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4837 conditions, 771 events. 439/771 cut-off events. For 40530/40530 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3332 event pairs, 76 based on Foata normal form. 2/769 useless extension candidates. Maximal degree in co-relation 4756. Up to 616 conditions per place. [2024-06-14 13:56:27,077 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 110 selfloop transitions, 46 changer transitions 0/158 dead transitions. [2024-06-14 13:56:27,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 158 transitions, 1666 flow [2024-06-14 13:56:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:56:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:56:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 13:56:27,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2024-06-14 13:56:27,078 INFO L175 Difference]: Start difference. First operand has 165 places, 141 transitions, 1268 flow. Second operand 10 states and 108 transitions. [2024-06-14 13:56:27,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 158 transitions, 1666 flow [2024-06-14 13:56:27,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 158 transitions, 1557 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 13:56:27,142 INFO L231 Difference]: Finished difference. Result has 167 places, 143 transitions, 1302 flow [2024-06-14 13:56:27,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1302, PETRI_PLACES=167, PETRI_TRANSITIONS=143} [2024-06-14 13:56:27,143 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-14 13:56:27,143 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 143 transitions, 1302 flow [2024-06-14 13:56:27,143 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 13:56:27,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:27,143 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 13:56:27,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 13:56:27,143 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 13:56:27,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1507871886, now seen corresponding path program 9 times [2024-06-14 13:56:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796616521] [2024-06-14 13:56:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:31,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796616521] [2024-06-14 13:56:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796616521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:31,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:31,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367820455] [2024-06-14 13:56:31,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:31,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:31,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:31,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:31,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:31,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 143 transitions, 1302 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 13:56:31,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:31,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:31,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:32,413 INFO L124 PetriNetUnfolderBase]: 445/781 cut-off events. [2024-06-14 13:56:32,413 INFO L125 PetriNetUnfolderBase]: For 41827/41827 co-relation queries the response was YES. [2024-06-14 13:56:32,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 781 events. 445/781 cut-off events. For 41827/41827 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3372 event pairs, 55 based on Foata normal form. 2/779 useless extension candidates. Maximal degree in co-relation 4853. Up to 475 conditions per place. [2024-06-14 13:56:32,418 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 106 selfloop transitions, 57 changer transitions 0/165 dead transitions. [2024-06-14 13:56:32,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 165 transitions, 1816 flow [2024-06-14 13:56:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:56:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:56:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 13:56:32,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-06-14 13:56:32,419 INFO L175 Difference]: Start difference. First operand has 167 places, 143 transitions, 1302 flow. Second operand 9 states and 111 transitions. [2024-06-14 13:56:32,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 165 transitions, 1816 flow [2024-06-14 13:56:32,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 165 transitions, 1689 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 13:56:32,494 INFO L231 Difference]: Finished difference. Result has 168 places, 145 transitions, 1324 flow [2024-06-14 13:56:32,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1324, PETRI_PLACES=168, PETRI_TRANSITIONS=145} [2024-06-14 13:56:32,494 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2024-06-14 13:56:32,494 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 145 transitions, 1324 flow [2024-06-14 13:56:32,494 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 13:56:32,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:32,494 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 13:56:32,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 13:56:32,495 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 13:56:32,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1508111454, now seen corresponding path program 6 times [2024-06-14 13:56:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536593019] [2024-06-14 13:56:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536593019] [2024-06-14 13:56:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536593019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:37,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:37,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:37,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612896327] [2024-06-14 13:56:37,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:37,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:37,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:37,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:37,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:37,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:37,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 145 transitions, 1324 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 13:56:37,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:37,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:37,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:38,262 INFO L124 PetriNetUnfolderBase]: 446/783 cut-off events. [2024-06-14 13:56:38,262 INFO L125 PetriNetUnfolderBase]: For 42071/42071 co-relation queries the response was YES. [2024-06-14 13:56:38,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4958 conditions, 783 events. 446/783 cut-off events. For 42071/42071 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3387 event pairs, 78 based on Foata normal form. 2/781 useless extension candidates. Maximal degree in co-relation 4875. Up to 628 conditions per place. [2024-06-14 13:56:38,267 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 42 changer transitions 0/162 dead transitions. [2024-06-14 13:56:38,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 162 transitions, 1734 flow [2024-06-14 13:56:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:56:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:56:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 13:56:38,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-14 13:56:38,268 INFO L175 Difference]: Start difference. First operand has 168 places, 145 transitions, 1324 flow. Second operand 10 states and 109 transitions. [2024-06-14 13:56:38,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 162 transitions, 1734 flow [2024-06-14 13:56:38,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 162 transitions, 1559 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 13:56:38,336 INFO L231 Difference]: Finished difference. Result has 170 places, 147 transitions, 1288 flow [2024-06-14 13:56:38,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1288, PETRI_PLACES=170, PETRI_TRANSITIONS=147} [2024-06-14 13:56:38,336 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 138 predicate places. [2024-06-14 13:56:38,336 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 147 transitions, 1288 flow [2024-06-14 13:56:38,336 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 13:56:38,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:38,337 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 13:56:38,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 13:56:38,337 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 13:56:38,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1507865376, now seen corresponding path program 10 times [2024-06-14 13:56:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154733645] [2024-06-14 13:56:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154733645] [2024-06-14 13:56:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154733645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:43,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851618341] [2024-06-14 13:56:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:43,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:43,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:43,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:43,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 147 transitions, 1288 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 13:56:43,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:43,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:43,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:43,936 INFO L124 PetriNetUnfolderBase]: 442/777 cut-off events. [2024-06-14 13:56:43,936 INFO L125 PetriNetUnfolderBase]: For 40139/40139 co-relation queries the response was YES. [2024-06-14 13:56:43,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4754 conditions, 777 events. 442/777 cut-off events. For 40139/40139 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3363 event pairs, 57 based on Foata normal form. 2/775 useless extension candidates. Maximal degree in co-relation 4670. Up to 474 conditions per place. [2024-06-14 13:56:43,941 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 104 selfloop transitions, 58 changer transitions 0/164 dead transitions. [2024-06-14 13:56:43,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 164 transitions, 1656 flow [2024-06-14 13:56:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:56:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:56:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 13:56:43,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602693602693603 [2024-06-14 13:56:43,942 INFO L175 Difference]: Start difference. First operand has 170 places, 147 transitions, 1288 flow. Second operand 9 states and 107 transitions. [2024-06-14 13:56:43,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 164 transitions, 1656 flow [2024-06-14 13:56:44,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 164 transitions, 1515 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-14 13:56:44,017 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 1268 flow [2024-06-14 13:56:44,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1268, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2024-06-14 13:56:44,018 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 139 predicate places. [2024-06-14 13:56:44,018 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 1268 flow [2024-06-14 13:56:44,018 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 13:56:44,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:44,018 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 13:56:44,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 13:56:44,018 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 13:56:44,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1702161975, now seen corresponding path program 1 times [2024-06-14 13:56:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:44,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964255346] [2024-06-14 13:56:44,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:44,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:49,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:49,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964255346] [2024-06-14 13:56:49,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964255346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:49,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:49,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:49,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482805682] [2024-06-14 13:56:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:49,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:49,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:49,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:49,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 transitions, 1268 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 13:56:49,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:49,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:49,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:49,595 INFO L124 PetriNetUnfolderBase]: 475/840 cut-off events. [2024-06-14 13:56:49,595 INFO L125 PetriNetUnfolderBase]: For 41384/41384 co-relation queries the response was YES. [2024-06-14 13:56:49,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5004 conditions, 840 events. 475/840 cut-off events. For 41384/41384 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3740 event pairs, 89 based on Foata normal form. 2/841 useless extension candidates. Maximal degree in co-relation 4919. Up to 741 conditions per place. [2024-06-14 13:56:49,601 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 154 selfloop transitions, 22 changer transitions 0/178 dead transitions. [2024-06-14 13:56:49,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 1757 flow [2024-06-14 13:56:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:56:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:56:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 13:56:49,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 13:56:49,602 INFO L175 Difference]: Start difference. First operand has 171 places, 147 transitions, 1268 flow. Second operand 10 states and 110 transitions. [2024-06-14 13:56:49,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 178 transitions, 1757 flow [2024-06-14 13:56:49,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 178 transitions, 1608 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 13:56:49,689 INFO L231 Difference]: Finished difference. Result has 176 places, 158 transitions, 1287 flow [2024-06-14 13:56:49,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1287, PETRI_PLACES=176, PETRI_TRANSITIONS=158} [2024-06-14 13:56:49,690 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 144 predicate places. [2024-06-14 13:56:49,690 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 158 transitions, 1287 flow [2024-06-14 13:56:49,690 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 13:56:49,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:49,690 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 13:56:49,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 13:56:49,690 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 13:56:49,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:49,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2055596499, now seen corresponding path program 2 times [2024-06-14 13:56:49,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:49,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504418943] [2024-06-14 13:56:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:49,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:56:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:56:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:56:56,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504418943] [2024-06-14 13:56:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504418943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:56:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:56:56,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:56:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708086932] [2024-06-14 13:56:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:56:56,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:56:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:56:56,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:56:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:56:56,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:56:56,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 158 transitions, 1287 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 13:56:56,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:56:56,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:56:56,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:56:56,893 INFO L124 PetriNetUnfolderBase]: 488/869 cut-off events. [2024-06-14 13:56:56,893 INFO L125 PetriNetUnfolderBase]: For 43260/43260 co-relation queries the response was YES. [2024-06-14 13:56:56,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 869 events. 488/869 cut-off events. For 43260/43260 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3989 event pairs, 117 based on Foata normal form. 2/870 useless extension candidates. Maximal degree in co-relation 4971. Up to 768 conditions per place. [2024-06-14 13:56:56,899 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 157 selfloop transitions, 22 changer transitions 0/181 dead transitions. [2024-06-14 13:56:56,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 181 transitions, 1721 flow [2024-06-14 13:56:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:56:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:56:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 13:56:56,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2024-06-14 13:56:56,900 INFO L175 Difference]: Start difference. First operand has 176 places, 158 transitions, 1287 flow. Second operand 10 states and 108 transitions. [2024-06-14 13:56:56,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 181 transitions, 1721 flow [2024-06-14 13:56:56,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 181 transitions, 1691 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-14 13:56:56,983 INFO L231 Difference]: Finished difference. Result has 185 places, 161 transitions, 1341 flow [2024-06-14 13:56:56,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1341, PETRI_PLACES=185, PETRI_TRANSITIONS=161} [2024-06-14 13:56:56,983 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 153 predicate places. [2024-06-14 13:56:56,983 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 161 transitions, 1341 flow [2024-06-14 13:56:56,984 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 13:56:56,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:56:56,984 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 13:56:56,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 13:56:56,984 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 13:56:56,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:56:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1893407077, now seen corresponding path program 3 times [2024-06-14 13:56:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:56:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606173015] [2024-06-14 13:56:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:56:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:56:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:02,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:02,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606173015] [2024-06-14 13:57:02,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606173015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:02,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:02,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:57:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901851097] [2024-06-14 13:57:02,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:02,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:57:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:57:02,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:57:02,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:02,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 161 transitions, 1341 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 13:57:02,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:02,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:02,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:03,265 INFO L124 PetriNetUnfolderBase]: 504/897 cut-off events. [2024-06-14 13:57:03,265 INFO L125 PetriNetUnfolderBase]: For 44522/44522 co-relation queries the response was YES. [2024-06-14 13:57:03,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5238 conditions, 897 events. 504/897 cut-off events. For 44522/44522 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4146 event pairs, 126 based on Foata normal form. 2/898 useless extension candidates. Maximal degree in co-relation 5145. Up to 800 conditions per place. [2024-06-14 13:57:03,272 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 159 selfloop transitions, 24 changer transitions 0/185 dead transitions. [2024-06-14 13:57:03,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 185 transitions, 1795 flow [2024-06-14 13:57:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:57:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:57:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 13:57:03,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-14 13:57:03,273 INFO L175 Difference]: Start difference. First operand has 185 places, 161 transitions, 1341 flow. Second operand 10 states and 109 transitions. [2024-06-14 13:57:03,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 185 transitions, 1795 flow [2024-06-14 13:57:03,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 185 transitions, 1741 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 13:57:03,362 INFO L231 Difference]: Finished difference. Result has 192 places, 166 transitions, 1397 flow [2024-06-14 13:57:03,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1397, PETRI_PLACES=192, PETRI_TRANSITIONS=166} [2024-06-14 13:57:03,362 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 160 predicate places. [2024-06-14 13:57:03,362 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 166 transitions, 1397 flow [2024-06-14 13:57:03,362 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 13:57:03,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:03,363 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 13:57:03,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 13:57:03,363 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 13:57:03,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1893122497, now seen corresponding path program 4 times [2024-06-14 13:57:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:03,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330686885] [2024-06-14 13:57:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330686885] [2024-06-14 13:57:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330686885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:08,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:08,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:57:08,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283945317] [2024-06-14 13:57:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:08,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:57:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:57:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:57:08,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:08,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 166 transitions, 1397 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 13:57:08,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:08,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:08,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:09,314 INFO L124 PetriNetUnfolderBase]: 512/913 cut-off events. [2024-06-14 13:57:09,314 INFO L125 PetriNetUnfolderBase]: For 46472/46472 co-relation queries the response was YES. [2024-06-14 13:57:09,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 913 events. 512/913 cut-off events. For 46472/46472 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4265 event pairs, 125 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 5255. Up to 802 conditions per place. [2024-06-14 13:57:09,321 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 160 selfloop transitions, 25 changer transitions 0/187 dead transitions. [2024-06-14 13:57:09,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 187 transitions, 1834 flow [2024-06-14 13:57:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:57:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:57:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 13:57:09,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 13:57:09,322 INFO L175 Difference]: Start difference. First operand has 192 places, 166 transitions, 1397 flow. Second operand 10 states and 110 transitions. [2024-06-14 13:57:09,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 187 transitions, 1834 flow [2024-06-14 13:57:09,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 187 transitions, 1780 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 13:57:09,427 INFO L231 Difference]: Finished difference. Result has 197 places, 168 transitions, 1426 flow [2024-06-14 13:57:09,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1426, PETRI_PLACES=197, PETRI_TRANSITIONS=168} [2024-06-14 13:57:09,428 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2024-06-14 13:57:09,428 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 168 transitions, 1426 flow [2024-06-14 13:57:09,428 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 13:57:09,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:09,428 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 13:57:09,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 13:57:09,429 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 13:57:09,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash -261414249, now seen corresponding path program 5 times [2024-06-14 13:57:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:09,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397972334] [2024-06-14 13:57:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:09,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:15,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:15,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397972334] [2024-06-14 13:57:15,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397972334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:15,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:15,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:57:15,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400271039] [2024-06-14 13:57:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:15,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:57:15,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:15,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:57:15,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:57:15,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:15,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 168 transitions, 1426 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 13:57:15,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:15,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:15,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:15,840 INFO L124 PetriNetUnfolderBase]: 525/940 cut-off events. [2024-06-14 13:57:15,840 INFO L125 PetriNetUnfolderBase]: For 48240/48240 co-relation queries the response was YES. [2024-06-14 13:57:15,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5504 conditions, 940 events. 525/940 cut-off events. For 48240/48240 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4481 event pairs, 103 based on Foata normal form. 2/941 useless extension candidates. Maximal degree in co-relation 5406. Up to 804 conditions per place. [2024-06-14 13:57:15,846 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 163 selfloop transitions, 25 changer transitions 0/190 dead transitions. [2024-06-14 13:57:15,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 190 transitions, 1884 flow [2024-06-14 13:57:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:57:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:57:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 13:57:15,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2024-06-14 13:57:15,847 INFO L175 Difference]: Start difference. First operand has 197 places, 168 transitions, 1426 flow. Second operand 10 states and 105 transitions. [2024-06-14 13:57:15,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 190 transitions, 1884 flow [2024-06-14 13:57:15,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 190 transitions, 1824 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 13:57:15,948 INFO L231 Difference]: Finished difference. Result has 201 places, 171 transitions, 1462 flow [2024-06-14 13:57:15,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1366, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1462, PETRI_PLACES=201, PETRI_TRANSITIONS=171} [2024-06-14 13:57:15,949 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-14 13:57:15,949 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 171 transitions, 1462 flow [2024-06-14 13:57:15,949 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 13:57:15,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:15,949 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 13:57:15,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 13:57:15,950 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 13:57:15,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1541940631, now seen corresponding path program 1 times [2024-06-14 13:57:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007781805] [2024-06-14 13:57:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007781805] [2024-06-14 13:57:22,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007781805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:57:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508724386] [2024-06-14 13:57:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:22,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:57:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:22,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:57:22,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:57:22,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:22,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 171 transitions, 1462 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 13:57:22,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:22,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:22,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:23,397 INFO L124 PetriNetUnfolderBase]: 597/1060 cut-off events. [2024-06-14 13:57:23,397 INFO L125 PetriNetUnfolderBase]: For 50667/50667 co-relation queries the response was YES. [2024-06-14 13:57:23,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6017 conditions, 1060 events. 597/1060 cut-off events. For 50667/50667 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5201 event pairs, 120 based on Foata normal form. 2/1061 useless extension candidates. Maximal degree in co-relation 5917. Up to 831 conditions per place. [2024-06-14 13:57:23,405 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 169 selfloop transitions, 55 changer transitions 0/226 dead transitions. [2024-06-14 13:57:23,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 226 transitions, 2195 flow [2024-06-14 13:57:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 13:57:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 13:57:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-14 13:57:23,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34595959595959597 [2024-06-14 13:57:23,407 INFO L175 Difference]: Start difference. First operand has 201 places, 171 transitions, 1462 flow. Second operand 12 states and 137 transitions. [2024-06-14 13:57:23,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 226 transitions, 2195 flow [2024-06-14 13:57:23,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 226 transitions, 2116 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 13:57:23,536 INFO L231 Difference]: Finished difference. Result has 209 places, 196 transitions, 1784 flow [2024-06-14 13:57:23,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1784, PETRI_PLACES=209, PETRI_TRANSITIONS=196} [2024-06-14 13:57:23,536 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-14 13:57:23,536 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 196 transitions, 1784 flow [2024-06-14 13:57:23,536 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 13:57:23,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:23,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 13:57:23,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 13:57:23,537 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 13:57:23,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2038726817, now seen corresponding path program 6 times [2024-06-14 13:57:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:23,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069284902] [2024-06-14 13:57:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:23,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069284902] [2024-06-14 13:57:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069284902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:30,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:57:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066953914] [2024-06-14 13:57:30,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:30,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:57:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:30,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:57:30,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:57:30,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:30,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 196 transitions, 1784 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 13:57:30,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:30,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:30,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:30,824 INFO L124 PetriNetUnfolderBase]: 601/1068 cut-off events. [2024-06-14 13:57:30,824 INFO L125 PetriNetUnfolderBase]: For 51645/51645 co-relation queries the response was YES. [2024-06-14 13:57:30,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6316 conditions, 1068 events. 601/1068 cut-off events. For 51645/51645 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5251 event pairs, 113 based on Foata normal form. 2/1069 useless extension candidates. Maximal degree in co-relation 6213. Up to 971 conditions per place. [2024-06-14 13:57:30,832 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 190 selfloop transitions, 24 changer transitions 0/216 dead transitions. [2024-06-14 13:57:30,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 2280 flow [2024-06-14 13:57:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:57:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:57:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 13:57:30,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2024-06-14 13:57:30,834 INFO L175 Difference]: Start difference. First operand has 209 places, 196 transitions, 1784 flow. Second operand 10 states and 111 transitions. [2024-06-14 13:57:30,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 216 transitions, 2280 flow [2024-06-14 13:57:30,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 216 transitions, 2165 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 13:57:30,966 INFO L231 Difference]: Finished difference. Result has 210 places, 197 transitions, 1745 flow [2024-06-14 13:57:30,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1745, PETRI_PLACES=210, PETRI_TRANSITIONS=197} [2024-06-14 13:57:30,967 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 178 predicate places. [2024-06-14 13:57:30,967 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 197 transitions, 1745 flow [2024-06-14 13:57:30,967 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 13:57:30,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:30,967 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 13:57:30,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 13:57:30,967 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 13:57:30,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1224447017, now seen corresponding path program 7 times [2024-06-14 13:57:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:30,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228683384] [2024-06-14 13:57:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:36,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228683384] [2024-06-14 13:57:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228683384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:36,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:57:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199854520] [2024-06-14 13:57:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:36,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:57:36,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:36,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:57:36,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:57:36,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:36,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 197 transitions, 1745 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 13:57:36,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:36,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:36,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:37,417 INFO L124 PetriNetUnfolderBase]: 609/1084 cut-off events. [2024-06-14 13:57:37,417 INFO L125 PetriNetUnfolderBase]: For 53875/53875 co-relation queries the response was YES. [2024-06-14 13:57:37,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6345 conditions, 1084 events. 609/1084 cut-off events. For 53875/53875 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5380 event pairs, 111 based on Foata normal form. 2/1085 useless extension candidates. Maximal degree in co-relation 6242. Up to 973 conditions per place. [2024-06-14 13:57:37,426 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 191 selfloop transitions, 25 changer transitions 0/218 dead transitions. [2024-06-14 13:57:37,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 218 transitions, 2252 flow [2024-06-14 13:57:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:57:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:57:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 13:57:37,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-14 13:57:37,427 INFO L175 Difference]: Start difference. First operand has 210 places, 197 transitions, 1745 flow. Second operand 10 states and 112 transitions. [2024-06-14 13:57:37,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 218 transitions, 2252 flow [2024-06-14 13:57:37,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 218 transitions, 2178 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-14 13:57:37,579 INFO L231 Difference]: Finished difference. Result has 213 places, 199 transitions, 1762 flow [2024-06-14 13:57:37,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1762, PETRI_PLACES=213, PETRI_TRANSITIONS=199} [2024-06-14 13:57:37,579 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 181 predicate places. [2024-06-14 13:57:37,579 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 199 transitions, 1762 flow [2024-06-14 13:57:37,580 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 13:57:37,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:37,580 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 13:57:37,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 13:57:37,580 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 13:57:37,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 512591161, now seen corresponding path program 8 times [2024-06-14 13:57:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617234855] [2024-06-14 13:57:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:43,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:43,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617234855] [2024-06-14 13:57:43,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617234855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:43,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:43,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:57:43,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810826729] [2024-06-14 13:57:43,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:43,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:57:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:43,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:57:43,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:57:43,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:43,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 199 transitions, 1762 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 13:57:43,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:43,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:43,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:44,083 INFO L124 PetriNetUnfolderBase]: 613/1092 cut-off events. [2024-06-14 13:57:44,083 INFO L125 PetriNetUnfolderBase]: For 55730/55730 co-relation queries the response was YES. [2024-06-14 13:57:44,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 1092 events. 613/1092 cut-off events. For 55730/55730 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5442 event pairs, 103 based on Foata normal form. 2/1093 useless extension candidates. Maximal degree in co-relation 6303. Up to 935 conditions per place. [2024-06-14 13:57:44,091 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 181 selfloop transitions, 39 changer transitions 0/222 dead transitions. [2024-06-14 13:57:44,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 222 transitions, 2298 flow [2024-06-14 13:57:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:57:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:57:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 13:57:44,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-14 13:57:44,092 INFO L175 Difference]: Start difference. First operand has 213 places, 199 transitions, 1762 flow. Second operand 10 states and 114 transitions. [2024-06-14 13:57:44,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 222 transitions, 2298 flow [2024-06-14 13:57:44,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 222 transitions, 2230 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 13:57:44,239 INFO L231 Difference]: Finished difference. Result has 217 places, 201 transitions, 1831 flow [2024-06-14 13:57:44,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1831, PETRI_PLACES=217, PETRI_TRANSITIONS=201} [2024-06-14 13:57:44,240 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 185 predicate places. [2024-06-14 13:57:44,240 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 201 transitions, 1831 flow [2024-06-14 13:57:44,240 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 13:57:44,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:44,240 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 13:57:44,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 13:57:44,241 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 13:57:44,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash 512806363, now seen corresponding path program 2 times [2024-06-14 13:57:44,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:44,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959897451] [2024-06-14 13:57:44,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959897451] [2024-06-14 13:57:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959897451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:51,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:57:51,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037660107] [2024-06-14 13:57:51,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:51,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:57:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:51,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:57:51,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:57:52,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:52,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 201 transitions, 1831 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 13:57:52,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:52,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:52,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:52,610 INFO L124 PetriNetUnfolderBase]: 619/1102 cut-off events. [2024-06-14 13:57:52,611 INFO L125 PetriNetUnfolderBase]: For 57428/57428 co-relation queries the response was YES. [2024-06-14 13:57:52,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6538 conditions, 1102 events. 619/1102 cut-off events. For 57428/57428 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5491 event pairs, 102 based on Foata normal form. 2/1103 useless extension candidates. Maximal degree in co-relation 6433. Up to 865 conditions per place. [2024-06-14 13:57:52,620 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 173 selfloop transitions, 54 changer transitions 0/229 dead transitions. [2024-06-14 13:57:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 229 transitions, 2402 flow [2024-06-14 13:57:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 13:57:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 13:57:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 13:57:52,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3526170798898072 [2024-06-14 13:57:52,621 INFO L175 Difference]: Start difference. First operand has 217 places, 201 transitions, 1831 flow. Second operand 11 states and 128 transitions. [2024-06-14 13:57:52,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 229 transitions, 2402 flow [2024-06-14 13:57:52,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 229 transitions, 2306 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 13:57:52,783 INFO L231 Difference]: Finished difference. Result has 221 places, 203 transitions, 1889 flow [2024-06-14 13:57:52,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1735, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1889, PETRI_PLACES=221, PETRI_TRANSITIONS=203} [2024-06-14 13:57:52,783 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-14 13:57:52,783 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 203 transitions, 1889 flow [2024-06-14 13:57:52,784 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 13:57:52,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:52,784 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 13:57:52,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 13:57:52,784 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 13:57:52,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 512806642, now seen corresponding path program 1 times [2024-06-14 13:57:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330221422] [2024-06-14 13:57:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:57:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:57:58,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:57:58,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330221422] [2024-06-14 13:57:58,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330221422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:57:58,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:57:58,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:57:58,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276105733] [2024-06-14 13:57:58,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:57:58,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:57:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:57:58,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:57:58,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:57:58,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:57:58,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 203 transitions, 1889 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 13:57:58,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:57:58,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:57:58,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:57:59,183 INFO L124 PetriNetUnfolderBase]: 622/1107 cut-off events. [2024-06-14 13:57:59,183 INFO L125 PetriNetUnfolderBase]: For 57025/57025 co-relation queries the response was YES. [2024-06-14 13:57:59,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 1107 events. 622/1107 cut-off events. For 57025/57025 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5527 event pairs, 174 based on Foata normal form. 1/1107 useless extension candidates. Maximal degree in co-relation 6546. Up to 1014 conditions per place. [2024-06-14 13:57:59,190 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 189 selfloop transitions, 34 changer transitions 0/225 dead transitions. [2024-06-14 13:57:59,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 225 transitions, 2456 flow [2024-06-14 13:57:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 13:57:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 13:57:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 13:57:59,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-06-14 13:57:59,192 INFO L175 Difference]: Start difference. First operand has 221 places, 203 transitions, 1889 flow. Second operand 11 states and 116 transitions. [2024-06-14 13:57:59,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 225 transitions, 2456 flow [2024-06-14 13:57:59,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 225 transitions, 2320 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-14 13:57:59,335 INFO L231 Difference]: Finished difference. Result has 225 places, 207 transitions, 1918 flow [2024-06-14 13:57:59,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1918, PETRI_PLACES=225, PETRI_TRANSITIONS=207} [2024-06-14 13:57:59,336 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 193 predicate places. [2024-06-14 13:57:59,336 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 207 transitions, 1918 flow [2024-06-14 13:57:59,336 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 13:57:59,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:57:59,336 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 13:57:59,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 13:57:59,336 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 13:57:59,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:57:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 507084631, now seen corresponding path program 9 times [2024-06-14 13:57:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:57:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815612752] [2024-06-14 13:57:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:57:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:57:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:58:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815612752] [2024-06-14 13:58:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815612752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:05,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:58:05,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578445557] [2024-06-14 13:58:05,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:05,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:58:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:58:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:58:05,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:58:05,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 207 transitions, 1918 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 13:58:05,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:05,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:58:05,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:05,962 INFO L124 PetriNetUnfolderBase]: 626/1115 cut-off events. [2024-06-14 13:58:05,962 INFO L125 PetriNetUnfolderBase]: For 60774/60774 co-relation queries the response was YES. [2024-06-14 13:58:05,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6691 conditions, 1115 events. 626/1115 cut-off events. For 60774/60774 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5574 event pairs, 105 based on Foata normal form. 2/1116 useless extension candidates. Maximal degree in co-relation 6582. Up to 958 conditions per place. [2024-06-14 13:58:05,972 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 188 selfloop transitions, 37 changer transitions 0/227 dead transitions. [2024-06-14 13:58:05,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 2442 flow [2024-06-14 13:58:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:58:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:58:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 13:58:05,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-14 13:58:05,974 INFO L175 Difference]: Start difference. First operand has 225 places, 207 transitions, 1918 flow. Second operand 10 states and 114 transitions. [2024-06-14 13:58:05,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 2442 flow [2024-06-14 13:58:06,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 227 transitions, 2356 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 13:58:06,161 INFO L231 Difference]: Finished difference. Result has 230 places, 208 transitions, 1940 flow [2024-06-14 13:58:06,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1940, PETRI_PLACES=230, PETRI_TRANSITIONS=208} [2024-06-14 13:58:06,161 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 198 predicate places. [2024-06-14 13:58:06,161 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 208 transitions, 1940 flow [2024-06-14 13:58:06,161 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 13:58:06,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:58:06,161 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 13:58:06,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 13:58:06,162 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 13:58:06,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:58:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash 507080911, now seen corresponding path program 10 times [2024-06-14 13:58:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:58:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127987593] [2024-06-14 13:58:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:58:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:58:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:58:12,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:12,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127987593] [2024-06-14 13:58:12,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127987593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:12,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:12,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:58:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785804244] [2024-06-14 13:58:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:12,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:58:12,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:12,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:58:12,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:58:12,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:58:12,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 208 transitions, 1940 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 13:58:12,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:12,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:58:12,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:12,893 INFO L124 PetriNetUnfolderBase]: 634/1131 cut-off events. [2024-06-14 13:58:12,893 INFO L125 PetriNetUnfolderBase]: For 61747/61747 co-relation queries the response was YES. [2024-06-14 13:58:12,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6775 conditions, 1131 events. 634/1131 cut-off events. For 61747/61747 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5682 event pairs, 107 based on Foata normal form. 2/1132 useless extension candidates. Maximal degree in co-relation 6665. Up to 954 conditions per place. [2024-06-14 13:58:12,904 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 188 selfloop transitions, 39 changer transitions 0/229 dead transitions. [2024-06-14 13:58:12,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 229 transitions, 2473 flow [2024-06-14 13:58:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:58:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:58:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 13:58:12,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-14 13:58:12,905 INFO L175 Difference]: Start difference. First operand has 230 places, 208 transitions, 1940 flow. Second operand 10 states and 114 transitions. [2024-06-14 13:58:12,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 229 transitions, 2473 flow [2024-06-14 13:58:13,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 229 transitions, 2371 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 13:58:13,040 INFO L231 Difference]: Finished difference. Result has 234 places, 210 transitions, 1963 flow [2024-06-14 13:58:13,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1963, PETRI_PLACES=234, PETRI_TRANSITIONS=210} [2024-06-14 13:58:13,041 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 202 predicate places. [2024-06-14 13:58:13,041 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 210 transitions, 1963 flow [2024-06-14 13:58:13,041 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 13:58:13,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:58:13,041 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 13:58:13,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 13:58:13,041 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 13:58:13,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:58:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 650486109, now seen corresponding path program 1 times [2024-06-14 13:58:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:58:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876168935] [2024-06-14 13:58:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:58:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:58:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:58:18,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:18,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876168935] [2024-06-14 13:58:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876168935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:18,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:58:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445304361] [2024-06-14 13:58:18,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:18,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:58:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:58:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:58:18,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:58:18,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 210 transitions, 1963 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 13:58:18,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:18,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:58:18,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:19,374 INFO L124 PetriNetUnfolderBase]: 642/1148 cut-off events. [2024-06-14 13:58:19,374 INFO L125 PetriNetUnfolderBase]: For 69318/69318 co-relation queries the response was YES. [2024-06-14 13:58:19,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6881 conditions, 1148 events. 642/1148 cut-off events. For 69318/69318 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5852 event pairs, 158 based on Foata normal form. 4/1149 useless extension candidates. Maximal degree in co-relation 6769. Up to 1053 conditions per place. [2024-06-14 13:58:19,383 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 203 selfloop transitions, 27 changer transitions 0/232 dead transitions. [2024-06-14 13:58:19,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 232 transitions, 2517 flow [2024-06-14 13:58:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 13:58:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 13:58:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2024-06-14 13:58:19,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31313131313131315 [2024-06-14 13:58:19,385 INFO L175 Difference]: Start difference. First operand has 234 places, 210 transitions, 1963 flow. Second operand 12 states and 124 transitions. [2024-06-14 13:58:19,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 232 transitions, 2517 flow [2024-06-14 13:58:19,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 232 transitions, 2419 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 13:58:19,533 INFO L231 Difference]: Finished difference. Result has 239 places, 211 transitions, 1959 flow [2024-06-14 13:58:19,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1959, PETRI_PLACES=239, PETRI_TRANSITIONS=211} [2024-06-14 13:58:19,534 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2024-06-14 13:58:19,534 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 211 transitions, 1959 flow [2024-06-14 13:58:19,534 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 13:58:19,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:58:19,535 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 13:58:19,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 13:58:19,535 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 13:58:19,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:58:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1437509135, now seen corresponding path program 11 times [2024-06-14 13:58:19,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:58:19,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383099436] [2024-06-14 13:58:19,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:58:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:58:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:58:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383099436] [2024-06-14 13:58:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383099436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:24,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:24,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:58:24,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820252290] [2024-06-14 13:58:24,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:24,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:58:24,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:58:24,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:58:24,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 13:58:24,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 211 transitions, 1959 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 13:58:24,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:24,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 13:58:24,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:25,312 INFO L124 PetriNetUnfolderBase]: 646/1155 cut-off events. [2024-06-14 13:58:25,312 INFO L125 PetriNetUnfolderBase]: For 65694/65694 co-relation queries the response was YES. [2024-06-14 13:58:25,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6913 conditions, 1155 events. 646/1155 cut-off events. For 65694/65694 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5866 event pairs, 113 based on Foata normal form. 2/1156 useless extension candidates. Maximal degree in co-relation 6800. Up to 971 conditions per place. [2024-06-14 13:58:25,323 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 196 selfloop transitions, 30 changer transitions 0/228 dead transitions. [2024-06-14 13:58:25,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 228 transitions, 2481 flow [2024-06-14 13:58:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:58:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:58:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 13:58:25,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-14 13:58:25,324 INFO L175 Difference]: Start difference. First operand has 239 places, 211 transitions, 1959 flow. Second operand 9 states and 105 transitions. [2024-06-14 13:58:25,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 228 transitions, 2481 flow [2024-06-14 13:58:25,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 228 transitions, 2397 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-14 13:58:25,493 INFO L231 Difference]: Finished difference. Result has 238 places, 212 transitions, 1979 flow [2024-06-14 13:58:25,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1979, PETRI_PLACES=238, PETRI_TRANSITIONS=212} [2024-06-14 13:58:25,493 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 206 predicate places. [2024-06-14 13:58:25,493 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 212 transitions, 1979 flow [2024-06-14 13:58:25,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 13:58:25,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:58:25,494 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 13:58:25,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 13:58:25,494 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 13:58:25,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:58:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -969232189, now seen corresponding path program 12 times [2024-06-14 13:58:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:58:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485188527] [2024-06-14 13:58:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:58:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:58:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:58:31,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485188527] [2024-06-14 13:58:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485188527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:31,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:58:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216592561] [2024-06-14 13:58:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:31,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:58:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:31,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:58:31,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:58:31,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:58:31,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 212 transitions, 1979 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 13:58:31,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:31,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:58:31,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:32,332 INFO L124 PetriNetUnfolderBase]: 650/1163 cut-off events. [2024-06-14 13:58:32,332 INFO L125 PetriNetUnfolderBase]: For 67525/67525 co-relation queries the response was YES. [2024-06-14 13:58:32,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7009 conditions, 1163 events. 650/1163 cut-off events. For 67525/67525 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5949 event pairs, 150 based on Foata normal form. 2/1164 useless extension candidates. Maximal degree in co-relation 6895. Up to 1022 conditions per place. [2024-06-14 13:58:32,342 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 194 selfloop transitions, 33 changer transitions 0/229 dead transitions. [2024-06-14 13:58:32,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 229 transitions, 2505 flow [2024-06-14 13:58:32,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:58:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:58:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 13:58:32,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 13:58:32,343 INFO L175 Difference]: Start difference. First operand has 238 places, 212 transitions, 1979 flow. Second operand 9 states and 99 transitions. [2024-06-14 13:58:32,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 229 transitions, 2505 flow [2024-06-14 13:58:32,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 229 transitions, 2411 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 13:58:32,546 INFO L231 Difference]: Finished difference. Result has 240 places, 213 transitions, 1995 flow [2024-06-14 13:58:32,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1995, PETRI_PLACES=240, PETRI_TRANSITIONS=213} [2024-06-14 13:58:32,546 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 208 predicate places. [2024-06-14 13:58:32,546 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 213 transitions, 1995 flow [2024-06-14 13:58:32,547 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 13:58:32,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:58:32,547 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 13:58:32,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 13:58:32,547 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 13:58:32,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:58:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2007672659, now seen corresponding path program 13 times [2024-06-14 13:58:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:58:32,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515840994] [2024-06-14 13:58:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:58:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:58:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:58:39,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:39,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515840994] [2024-06-14 13:58:39,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515840994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:39,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:39,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:58:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603529753] [2024-06-14 13:58:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:39,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:58:39,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:39,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:58:39,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:58:39,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:58:39,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 213 transitions, 1995 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 13:58:39,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:39,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:58:39,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:39,800 INFO L124 PetriNetUnfolderBase]: 654/1171 cut-off events. [2024-06-14 13:58:39,801 INFO L125 PetriNetUnfolderBase]: For 63726/63726 co-relation queries the response was YES. [2024-06-14 13:58:39,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6988 conditions, 1171 events. 654/1171 cut-off events. For 63726/63726 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6002 event pairs, 141 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 6873. Up to 988 conditions per place. [2024-06-14 13:58:39,810 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 192 selfloop transitions, 36 changer transitions 0/230 dead transitions. [2024-06-14 13:58:39,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 230 transitions, 2519 flow [2024-06-14 13:58:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:58:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:58:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-14 13:58:39,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367003367003367 [2024-06-14 13:58:39,812 INFO L175 Difference]: Start difference. First operand has 240 places, 213 transitions, 1995 flow. Second operand 9 states and 100 transitions. [2024-06-14 13:58:39,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 230 transitions, 2519 flow [2024-06-14 13:58:39,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 230 transitions, 2425 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 13:58:39,972 INFO L231 Difference]: Finished difference. Result has 242 places, 214 transitions, 2013 flow [2024-06-14 13:58:39,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2013, PETRI_PLACES=242, PETRI_TRANSITIONS=214} [2024-06-14 13:58:39,972 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 210 predicate places. [2024-06-14 13:58:39,972 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 214 transitions, 2013 flow [2024-06-14 13:58:39,972 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 13:58:39,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:58:39,972 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 13:58:39,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 13:58:39,972 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 13:58:39,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:58:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1920827027, now seen corresponding path program 3 times [2024-06-14 13:58:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:58:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193502168] [2024-06-14 13:58:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:58:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:58:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:58:46,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:46,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193502168] [2024-06-14 13:58:46,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193502168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:46,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:46,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:58:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485293527] [2024-06-14 13:58:46,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:46,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:58:46,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:46,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:58:46,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:58:46,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:58:46,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 214 transitions, 2013 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 13:58:46,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:46,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:58:46,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:47,179 INFO L124 PetriNetUnfolderBase]: 666/1191 cut-off events. [2024-06-14 13:58:47,180 INFO L125 PetriNetUnfolderBase]: For 61955/61955 co-relation queries the response was YES. [2024-06-14 13:58:47,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7038 conditions, 1191 events. 666/1191 cut-off events. For 61955/61955 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6136 event pairs, 152 based on Foata normal form. 2/1192 useless extension candidates. Maximal degree in co-relation 6922. Up to 1032 conditions per place. [2024-06-14 13:58:47,191 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 196 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2024-06-14 13:58:47,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 236 transitions, 2573 flow [2024-06-14 13:58:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:58:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:58:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 13:58:47,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-14 13:58:47,197 INFO L175 Difference]: Start difference. First operand has 242 places, 214 transitions, 2013 flow. Second operand 10 states and 109 transitions. [2024-06-14 13:58:47,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 236 transitions, 2573 flow [2024-06-14 13:58:47,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 236 transitions, 2479 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 13:58:47,373 INFO L231 Difference]: Finished difference. Result has 245 places, 218 transitions, 2061 flow [2024-06-14 13:58:47,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2061, PETRI_PLACES=245, PETRI_TRANSITIONS=218} [2024-06-14 13:58:47,373 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 213 predicate places. [2024-06-14 13:58:47,373 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 218 transitions, 2061 flow [2024-06-14 13:58:47,373 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 13:58:47,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:58:47,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:58:47,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 13:58:47,374 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 13:58:47,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:58:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1850627149, now seen corresponding path program 14 times [2024-06-14 13:58:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:58:47,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563619791] [2024-06-14 13:58:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:58:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:58:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:53,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 13:58:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563619791] [2024-06-14 13:58:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563619791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:53,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:53,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 13:58:53,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501911072] [2024-06-14 13:58:53,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:53,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 13:58:53,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:53,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 13:58:53,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 13:58:53,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:58:53,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 218 transitions, 2061 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 13:58:53,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:53,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:58:53,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:53,956 INFO L124 PetriNetUnfolderBase]: 670/1199 cut-off events. [2024-06-14 13:58:53,956 INFO L125 PetriNetUnfolderBase]: For 59692/59692 co-relation queries the response was YES. [2024-06-14 13:58:53,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7076 conditions, 1199 events. 670/1199 cut-off events. For 59692/59692 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6181 event pairs, 104 based on Foata normal form. 2/1200 useless extension candidates. Maximal degree in co-relation 6959. Up to 976 conditions per place. [2024-06-14 13:58:53,965 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 183 selfloop transitions, 50 changer transitions 0/235 dead transitions. [2024-06-14 13:58:53,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 235 transitions, 2589 flow [2024-06-14 13:58:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:58:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:58:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 13:58:53,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2024-06-14 13:58:53,966 INFO L175 Difference]: Start difference. First operand has 245 places, 218 transitions, 2061 flow. Second operand 9 states and 102 transitions. [2024-06-14 13:58:53,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 235 transitions, 2589 flow [2024-06-14 13:58:54,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 235 transitions, 2485 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 13:58:54,129 INFO L231 Difference]: Finished difference. Result has 246 places, 219 transitions, 2089 flow [2024-06-14 13:58:54,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2089, PETRI_PLACES=246, PETRI_TRANSITIONS=219} [2024-06-14 13:58:54,129 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 214 predicate places. [2024-06-14 13:58:54,129 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 219 transitions, 2089 flow [2024-06-14 13:58:54,129 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 13:58:54,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:58:54,129 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 13:58:54,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 13:58:54,130 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 13:58:54,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:58:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash -870521299, now seen corresponding path program 15 times [2024-06-14 13:58:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:58:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559646554] [2024-06-14 13:58:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:58:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:58:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:58:59,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 13:58:59,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:58:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559646554] [2024-06-14 13:58:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559646554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:58:59,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:58:59,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:58:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386952607] [2024-06-14 13:58:59,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:58:59,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:58:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:58:59,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:58:59,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:58:59,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:58:59,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 219 transitions, 2089 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 13:58:59,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:58:59,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:58:59,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:58:59,937 INFO L124 PetriNetUnfolderBase]: 681/1220 cut-off events. [2024-06-14 13:58:59,937 INFO L125 PetriNetUnfolderBase]: For 66673/66673 co-relation queries the response was YES. [2024-06-14 13:58:59,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7398 conditions, 1220 events. 681/1220 cut-off events. For 66673/66673 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6326 event pairs, 105 based on Foata normal form. 2/1221 useless extension candidates. Maximal degree in co-relation 7280. Up to 954 conditions per place. [2024-06-14 13:58:59,948 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 182 selfloop transitions, 54 changer transitions 0/238 dead transitions. [2024-06-14 13:58:59,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 238 transitions, 2787 flow [2024-06-14 13:58:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:58:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:58:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 13:58:59,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-14 13:58:59,950 INFO L175 Difference]: Start difference. First operand has 246 places, 219 transitions, 2089 flow. Second operand 9 states and 103 transitions. [2024-06-14 13:58:59,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 238 transitions, 2787 flow [2024-06-14 13:59:00,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 238 transitions, 2661 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 13:59:00,151 INFO L231 Difference]: Finished difference. Result has 248 places, 221 transitions, 2133 flow [2024-06-14 13:59:00,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1969, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2133, PETRI_PLACES=248, PETRI_TRANSITIONS=221} [2024-06-14 13:59:00,152 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 216 predicate places. [2024-06-14 13:59:00,152 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 221 transitions, 2133 flow [2024-06-14 13:59:00,152 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 13:59:00,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:00,152 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 13:59:00,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 13:59:00,152 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 13:59:00,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1658555671, now seen corresponding path program 16 times [2024-06-14 13:59:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:00,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582212523] [2024-06-14 13:59:00,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:05,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:05,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582212523] [2024-06-14 13:59:05,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582212523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:05,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:59:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507310642] [2024-06-14 13:59:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:05,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:59:05,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:05,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:59:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:59:05,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:59:05,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 221 transitions, 2133 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 13:59:05,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:05,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:59:05,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:05,967 INFO L124 PetriNetUnfolderBase]: 678/1215 cut-off events. [2024-06-14 13:59:05,967 INFO L125 PetriNetUnfolderBase]: For 62046/62046 co-relation queries the response was YES. [2024-06-14 13:59:05,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7211 conditions, 1215 events. 678/1215 cut-off events. For 62046/62046 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6285 event pairs, 101 based on Foata normal form. 2/1216 useless extension candidates. Maximal degree in co-relation 7092. Up to 992 conditions per place. [2024-06-14 13:59:05,977 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 183 selfloop transitions, 53 changer transitions 0/238 dead transitions. [2024-06-14 13:59:05,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 238 transitions, 2647 flow [2024-06-14 13:59:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:59:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:59:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 13:59:05,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2024-06-14 13:59:05,978 INFO L175 Difference]: Start difference. First operand has 248 places, 221 transitions, 2133 flow. Second operand 9 states and 102 transitions. [2024-06-14 13:59:05,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 238 transitions, 2647 flow [2024-06-14 13:59:06,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 238 transitions, 2545 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-14 13:59:06,148 INFO L231 Difference]: Finished difference. Result has 252 places, 221 transitions, 2143 flow [2024-06-14 13:59:06,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2143, PETRI_PLACES=252, PETRI_TRANSITIONS=221} [2024-06-14 13:59:06,149 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-14 13:59:06,149 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 221 transitions, 2143 flow [2024-06-14 13:59:06,149 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 13:59:06,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:06,149 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 13:59:06,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 13:59:06,150 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 13:59:06,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash -864795847, now seen corresponding path program 4 times [2024-06-14 13:59:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:06,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452498605] [2024-06-14 13:59:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:06,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:14,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452498605] [2024-06-14 13:59:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452498605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:14,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:59:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152385032] [2024-06-14 13:59:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:14,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:59:14,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:14,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:59:14,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:59:15,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:59:15,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 221 transitions, 2143 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 13:59:15,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:15,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:59:15,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:15,791 INFO L124 PetriNetUnfolderBase]: 694/1241 cut-off events. [2024-06-14 13:59:15,791 INFO L125 PetriNetUnfolderBase]: For 68355/68355 co-relation queries the response was YES. [2024-06-14 13:59:15,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7612 conditions, 1241 events. 694/1241 cut-off events. For 68355/68355 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6437 event pairs, 99 based on Foata normal form. 2/1242 useless extension candidates. Maximal degree in co-relation 7491. Up to 851 conditions per place. [2024-06-14 13:59:15,804 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 158 selfloop transitions, 87 changer transitions 0/247 dead transitions. [2024-06-14 13:59:15,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 247 transitions, 2913 flow [2024-06-14 13:59:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:59:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:59:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 13:59:15,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455 [2024-06-14 13:59:15,806 INFO L175 Difference]: Start difference. First operand has 252 places, 221 transitions, 2143 flow. Second operand 10 states and 117 transitions. [2024-06-14 13:59:15,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 247 transitions, 2913 flow [2024-06-14 13:59:16,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 247 transitions, 2797 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 13:59:16,010 INFO L231 Difference]: Finished difference. Result has 254 places, 225 transitions, 2303 flow [2024-06-14 13:59:16,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2303, PETRI_PLACES=254, PETRI_TRANSITIONS=225} [2024-06-14 13:59:16,010 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 222 predicate places. [2024-06-14 13:59:16,010 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 225 transitions, 2303 flow [2024-06-14 13:59:16,011 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 13:59:16,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:16,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:59:16,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 13:59:16,011 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 13:59:16,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1686448193, now seen corresponding path program 5 times [2024-06-14 13:59:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166968368] [2024-06-14 13:59:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:22,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166968368] [2024-06-14 13:59:22,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166968368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:22,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:22,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:59:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564515664] [2024-06-14 13:59:22,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:22,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:59:22,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:22,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:59:22,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:59:22,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:59:22,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 225 transitions, 2303 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 13:59:22,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:22,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:59:22,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:22,975 INFO L124 PetriNetUnfolderBase]: 706/1261 cut-off events. [2024-06-14 13:59:22,975 INFO L125 PetriNetUnfolderBase]: For 70842/70842 co-relation queries the response was YES. [2024-06-14 13:59:22,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7893 conditions, 1261 events. 706/1261 cut-off events. For 70842/70842 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6582 event pairs, 111 based on Foata normal form. 2/1262 useless extension candidates. Maximal degree in co-relation 7771. Up to 944 conditions per place. [2024-06-14 13:59:22,987 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 178 selfloop transitions, 67 changer transitions 0/247 dead transitions. [2024-06-14 13:59:22,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 247 transitions, 2901 flow [2024-06-14 13:59:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:59:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:59:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 13:59:22,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-14 13:59:22,988 INFO L175 Difference]: Start difference. First operand has 254 places, 225 transitions, 2303 flow. Second operand 10 states and 114 transitions. [2024-06-14 13:59:22,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 247 transitions, 2901 flow [2024-06-14 13:59:23,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 247 transitions, 2760 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-14 13:59:23,259 INFO L231 Difference]: Finished difference. Result has 258 places, 229 transitions, 2378 flow [2024-06-14 13:59:23,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2378, PETRI_PLACES=258, PETRI_TRANSITIONS=229} [2024-06-14 13:59:23,259 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 226 predicate places. [2024-06-14 13:59:23,260 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 229 transitions, 2378 flow [2024-06-14 13:59:23,260 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 13:59:23,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:23,260 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 13:59:23,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 13:59:23,260 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 13:59:23,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1680876284, now seen corresponding path program 2 times [2024-06-14 13:59:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:23,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103496569] [2024-06-14 13:59:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:29,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 13:59:29,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:29,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103496569] [2024-06-14 13:59:29,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103496569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:29,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:59:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914620096] [2024-06-14 13:59:29,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:29,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:59:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:29,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:59:29,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:59:29,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:59:29,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 229 transitions, 2378 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 13:59:29,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:29,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:59:29,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:30,308 INFO L124 PetriNetUnfolderBase]: 704/1258 cut-off events. [2024-06-14 13:59:30,309 INFO L125 PetriNetUnfolderBase]: For 67742/67742 co-relation queries the response was YES. [2024-06-14 13:59:30,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7864 conditions, 1258 events. 704/1258 cut-off events. For 67742/67742 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6583 event pairs, 183 based on Foata normal form. 1/1258 useless extension candidates. Maximal degree in co-relation 7740. Up to 1112 conditions per place. [2024-06-14 13:59:30,320 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 193 selfloop transitions, 52 changer transitions 0/247 dead transitions. [2024-06-14 13:59:30,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 247 transitions, 2966 flow [2024-06-14 13:59:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:59:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:59:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 13:59:30,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2024-06-14 13:59:30,321 INFO L175 Difference]: Start difference. First operand has 258 places, 229 transitions, 2378 flow. Second operand 10 states and 106 transitions. [2024-06-14 13:59:30,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 247 transitions, 2966 flow [2024-06-14 13:59:30,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 247 transitions, 2800 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 13:59:30,544 INFO L231 Difference]: Finished difference. Result has 260 places, 231 transitions, 2386 flow [2024-06-14 13:59:30,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2386, PETRI_PLACES=260, PETRI_TRANSITIONS=231} [2024-06-14 13:59:30,545 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 228 predicate places. [2024-06-14 13:59:30,545 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 231 transitions, 2386 flow [2024-06-14 13:59:30,545 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 13:59:30,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:30,546 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 13:59:30,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 13:59:30,546 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 13:59:30,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1699519839, now seen corresponding path program 6 times [2024-06-14 13:59:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896210643] [2024-06-14 13:59:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:38,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896210643] [2024-06-14 13:59:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896210643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:38,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:38,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:59:38,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664140848] [2024-06-14 13:59:38,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:38,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:59:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:59:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:59:38,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:59:38,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 231 transitions, 2386 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 13:59:38,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:38,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:59:38,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:39,175 INFO L124 PetriNetUnfolderBase]: 716/1278 cut-off events. [2024-06-14 13:59:39,175 INFO L125 PetriNetUnfolderBase]: For 71818/71818 co-relation queries the response was YES. [2024-06-14 13:59:39,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 1278 events. 716/1278 cut-off events. For 71818/71818 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6656 event pairs, 100 based on Foata normal form. 2/1279 useless extension candidates. Maximal degree in co-relation 7837. Up to 961 conditions per place. [2024-06-14 13:59:39,188 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 182 selfloop transitions, 70 changer transitions 0/254 dead transitions. [2024-06-14 13:59:39,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 254 transitions, 3006 flow [2024-06-14 13:59:39,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:59:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:59:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 13:59:39,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-14 13:59:39,192 INFO L175 Difference]: Start difference. First operand has 260 places, 231 transitions, 2386 flow. Second operand 10 states and 114 transitions. [2024-06-14 13:59:39,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 254 transitions, 3006 flow [2024-06-14 13:59:39,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 254 transitions, 2862 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-14 13:59:39,402 INFO L231 Difference]: Finished difference. Result has 262 places, 235 transitions, 2468 flow [2024-06-14 13:59:39,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2468, PETRI_PLACES=262, PETRI_TRANSITIONS=235} [2024-06-14 13:59:39,403 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 230 predicate places. [2024-06-14 13:59:39,403 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 235 transitions, 2468 flow [2024-06-14 13:59:39,403 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 13:59:39,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:39,403 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 13:59:39,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 13:59:39,403 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 13:59:39,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1680884003, now seen corresponding path program 7 times [2024-06-14 13:59:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827624884] [2024-06-14 13:59:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:46,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:46,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827624884] [2024-06-14 13:59:46,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827624884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:46,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:59:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862773727] [2024-06-14 13:59:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:46,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:59:46,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:59:46,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:59:47,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:59:47,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 235 transitions, 2468 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 13:59:47,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:47,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:59:47,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:47,653 INFO L124 PetriNetUnfolderBase]: 712/1272 cut-off events. [2024-06-14 13:59:47,653 INFO L125 PetriNetUnfolderBase]: For 65527/65527 co-relation queries the response was YES. [2024-06-14 13:59:47,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7779 conditions, 1272 events. 712/1272 cut-off events. For 65527/65527 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6658 event pairs, 99 based on Foata normal form. 2/1273 useless extension candidates. Maximal degree in co-relation 7653. Up to 955 conditions per place. [2024-06-14 13:59:47,665 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 178 selfloop transitions, 75 changer transitions 0/255 dead transitions. [2024-06-14 13:59:47,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 255 transitions, 3024 flow [2024-06-14 13:59:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 13:59:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 13:59:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 13:59:47,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-14 13:59:47,666 INFO L175 Difference]: Start difference. First operand has 262 places, 235 transitions, 2468 flow. Second operand 10 states and 114 transitions. [2024-06-14 13:59:47,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 255 transitions, 3024 flow [2024-06-14 13:59:47,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 255 transitions, 2818 flow, removed 36 selfloop flow, removed 8 redundant places. [2024-06-14 13:59:47,867 INFO L231 Difference]: Finished difference. Result has 264 places, 235 transitions, 2420 flow [2024-06-14 13:59:47,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2420, PETRI_PLACES=264, PETRI_TRANSITIONS=235} [2024-06-14 13:59:47,867 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 232 predicate places. [2024-06-14 13:59:47,867 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 235 transitions, 2420 flow [2024-06-14 13:59:47,867 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 13:59:47,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:47,868 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 13:59:47,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 13:59:47,868 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 13:59:47,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash -639672065, now seen corresponding path program 2 times [2024-06-14 13:59:47,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:47,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894849888] [2024-06-14 13:59:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:47,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894849888] [2024-06-14 13:59:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894849888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 13:59:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987626128] [2024-06-14 13:59:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:52,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 13:59:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 13:59:52,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 13:59:53,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:59:53,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 235 transitions, 2420 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 13:59:53,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:53,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:59:53,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:53,793 INFO L124 PetriNetUnfolderBase]: 720/1289 cut-off events. [2024-06-14 13:59:53,794 INFO L125 PetriNetUnfolderBase]: For 72723/72723 co-relation queries the response was YES. [2024-06-14 13:59:53,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7841 conditions, 1289 events. 720/1289 cut-off events. For 72723/72723 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6811 event pairs, 166 based on Foata normal form. 4/1290 useless extension candidates. Maximal degree in co-relation 7714. Up to 1140 conditions per place. [2024-06-14 13:59:53,805 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 216 selfloop transitions, 37 changer transitions 0/255 dead transitions. [2024-06-14 13:59:53,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 255 transitions, 3014 flow [2024-06-14 13:59:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 13:59:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 13:59:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 13:59:53,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3168044077134986 [2024-06-14 13:59:53,806 INFO L175 Difference]: Start difference. First operand has 264 places, 235 transitions, 2420 flow. Second operand 11 states and 115 transitions. [2024-06-14 13:59:53,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 255 transitions, 3014 flow [2024-06-14 13:59:53,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 255 transitions, 2806 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-14 13:59:53,994 INFO L231 Difference]: Finished difference. Result has 266 places, 236 transitions, 2328 flow [2024-06-14 13:59:53,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2328, PETRI_PLACES=266, PETRI_TRANSITIONS=236} [2024-06-14 13:59:53,995 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 234 predicate places. [2024-06-14 13:59:53,995 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 236 transitions, 2328 flow [2024-06-14 13:59:53,995 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 13:59:53,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:53,995 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 13:59:53,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 13:59:53,995 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 13:59:53,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1338655075, now seen corresponding path program 17 times [2024-06-14 13:59:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792412702] [2024-06-14 13:59:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:59,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:59,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792412702] [2024-06-14 13:59:59,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792412702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:59,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:59,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 13:59:59,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270913484] [2024-06-14 13:59:59,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:59,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 13:59:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:59,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 13:59:59,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 13:59:59,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 13:59:59,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 236 transitions, 2328 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 13:59:59,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:59,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 13:59:59,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:59,560 INFO L124 PetriNetUnfolderBase]: 724/1297 cut-off events. [2024-06-14 13:59:59,561 INFO L125 PetriNetUnfolderBase]: For 69110/69110 co-relation queries the response was YES. [2024-06-14 13:59:59,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7749 conditions, 1297 events. 724/1297 cut-off events. For 69110/69110 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6830 event pairs, 93 based on Foata normal form. 2/1293 useless extension candidates. Maximal degree in co-relation 7621. Up to 1027 conditions per place. [2024-06-14 13:59:59,573 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 190 selfloop transitions, 61 changer transitions 0/253 dead transitions. [2024-06-14 13:59:59,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 253 transitions, 2896 flow [2024-06-14 13:59:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 13:59:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 13:59:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 13:59:59,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-14 13:59:59,575 INFO L175 Difference]: Start difference. First operand has 266 places, 236 transitions, 2328 flow. Second operand 9 states and 103 transitions. [2024-06-14 13:59:59,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 253 transitions, 2896 flow [2024-06-14 13:59:59,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 253 transitions, 2792 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-14 13:59:59,791 INFO L231 Difference]: Finished difference. Result has 266 places, 237 transitions, 2378 flow [2024-06-14 13:59:59,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2378, PETRI_PLACES=266, PETRI_TRANSITIONS=237} [2024-06-14 13:59:59,791 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 234 predicate places. [2024-06-14 13:59:59,791 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 237 transitions, 2378 flow [2024-06-14 13:59:59,791 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 13:59:59,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:59,792 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 13:59:59,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 13:59:59,792 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 13:59:59,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1083128655, now seen corresponding path program 8 times [2024-06-14 13:59:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69562169] [2024-06-14 13:59:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:00:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:00:07,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:00:07,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69562169] [2024-06-14 14:00:07,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69562169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:00:07,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:00:07,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:00:07,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798947320] [2024-06-14 14:00:07,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:00:07,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:00:07,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:00:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:00:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:00:07,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:00:07,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 237 transitions, 2378 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 14:00:07,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:00:07,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:00:07,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:00:07,897 INFO L124 PetriNetUnfolderBase]: 740/1323 cut-off events. [2024-06-14 14:00:07,897 INFO L125 PetriNetUnfolderBase]: For 74484/74484 co-relation queries the response was YES. [2024-06-14 14:00:07,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8136 conditions, 1323 events. 740/1323 cut-off events. For 74484/74484 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6993 event pairs, 85 based on Foata normal form. 2/1319 useless extension candidates. Maximal degree in co-relation 8007. Up to 877 conditions per place. [2024-06-14 14:00:07,909 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 160 selfloop transitions, 101 changer transitions 0/263 dead transitions. [2024-06-14 14:00:07,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 263 transitions, 3196 flow [2024-06-14 14:00:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:00:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:00:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 14:00:07,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 14:00:07,911 INFO L175 Difference]: Start difference. First operand has 266 places, 237 transitions, 2378 flow. Second operand 10 states and 121 transitions. [2024-06-14 14:00:07,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 263 transitions, 3196 flow [2024-06-14 14:00:08,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 263 transitions, 3052 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 14:00:08,144 INFO L231 Difference]: Finished difference. Result has 269 places, 241 transitions, 2541 flow [2024-06-14 14:00:08,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2234, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2541, PETRI_PLACES=269, PETRI_TRANSITIONS=241} [2024-06-14 14:00:08,145 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 237 predicate places. [2024-06-14 14:00:08,145 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 241 transitions, 2541 flow [2024-06-14 14:00:08,145 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 14:00:08,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:00:08,145 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 14:00:08,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 14:00:08,146 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 14:00:08,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:00:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash 69076409, now seen corresponding path program 9 times [2024-06-14 14:00:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:00:08,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118001400] [2024-06-14 14:00:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:00:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:00:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:00:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:00:15,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:00:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118001400] [2024-06-14 14:00:15,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118001400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:00:15,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:00:15,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:00:15,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54296921] [2024-06-14 14:00:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:00:15,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:00:15,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:00:15,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:00:15,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:00:15,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:00:15,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 241 transitions, 2541 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 14:00:15,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:00:15,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:00:15,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:00:15,898 INFO L124 PetriNetUnfolderBase]: 756/1349 cut-off events. [2024-06-14 14:00:15,898 INFO L125 PetriNetUnfolderBase]: For 82401/82401 co-relation queries the response was YES. [2024-06-14 14:00:15,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8645 conditions, 1349 events. 756/1349 cut-off events. For 82401/82401 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7138 event pairs, 109 based on Foata normal form. 2/1345 useless extension candidates. Maximal degree in co-relation 8515. Up to 895 conditions per place. [2024-06-14 14:00:15,911 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 186 selfloop transitions, 79 changer transitions 0/267 dead transitions. [2024-06-14 14:00:15,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 267 transitions, 3377 flow [2024-06-14 14:00:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:00:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:00:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:00:15,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-14 14:00:15,912 INFO L175 Difference]: Start difference. First operand has 269 places, 241 transitions, 2541 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:00:15,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 267 transitions, 3377 flow [2024-06-14 14:00:16,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 267 transitions, 3191 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-14 14:00:16,152 INFO L231 Difference]: Finished difference. Result has 273 places, 245 transitions, 2626 flow [2024-06-14 14:00:16,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2355, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2626, PETRI_PLACES=273, PETRI_TRANSITIONS=245} [2024-06-14 14:00:16,152 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 241 predicate places. [2024-06-14 14:00:16,152 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 245 transitions, 2626 flow [2024-06-14 14:00:16,152 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 14:00:16,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:00:16,152 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 14:00:16,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 14:00:16,153 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 14:00:16,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:00:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1083136095, now seen corresponding path program 10 times [2024-06-14 14:00:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:00:16,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871127355] [2024-06-14 14:00:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:00:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:00:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:00:23,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 14:00:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:00:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871127355] [2024-06-14 14:00:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871127355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:00:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:00:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:00:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081744289] [2024-06-14 14:00:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:00:23,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:00:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:00:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:00:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:00:23,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:00:23,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 245 transitions, 2626 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 14:00:23,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:00:23,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:00:23,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:00:24,289 INFO L124 PetriNetUnfolderBase]: 752/1343 cut-off events. [2024-06-14 14:00:24,290 INFO L125 PetriNetUnfolderBase]: For 78948/78948 co-relation queries the response was YES. [2024-06-14 14:00:24,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8530 conditions, 1343 events. 752/1343 cut-off events. For 78948/78948 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7109 event pairs, 85 based on Foata normal form. 2/1339 useless extension candidates. Maximal degree in co-relation 8398. Up to 914 conditions per place. [2024-06-14 14:00:24,303 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 164 selfloop transitions, 98 changer transitions 0/264 dead transitions. [2024-06-14 14:00:24,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 264 transitions, 3198 flow [2024-06-14 14:00:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:00:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:00:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 14:00:24,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-14 14:00:24,304 INFO L175 Difference]: Start difference. First operand has 273 places, 245 transitions, 2626 flow. Second operand 10 states and 116 transitions. [2024-06-14 14:00:24,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 264 transitions, 3198 flow [2024-06-14 14:00:24,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 264 transitions, 3014 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-06-14 14:00:24,556 INFO L231 Difference]: Finished difference. Result has 277 places, 245 transitions, 2643 flow [2024-06-14 14:00:24,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2643, PETRI_PLACES=277, PETRI_TRANSITIONS=245} [2024-06-14 14:00:24,557 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 245 predicate places. [2024-06-14 14:00:24,557 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 245 transitions, 2643 flow [2024-06-14 14:00:24,557 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 14:00:24,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:00:24,557 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 14:00:24,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 14:00:24,557 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 14:00:24,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:00:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -769169955, now seen corresponding path program 11 times [2024-06-14 14:00:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:00:24,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306532117] [2024-06-14 14:00:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:00:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:00:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:00:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:00:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:00:30,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306532117] [2024-06-14 14:00:30,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306532117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:00:30,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:00:30,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:00:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867769205] [2024-06-14 14:00:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:00:30,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:00:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:00:30,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:00:30,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:00:30,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:00:30,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 245 transitions, 2643 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 14:00:30,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:00:30,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:00:30,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:00:31,271 INFO L124 PetriNetUnfolderBase]: 774/1378 cut-off events. [2024-06-14 14:00:31,271 INFO L125 PetriNetUnfolderBase]: For 92639/92639 co-relation queries the response was YES. [2024-06-14 14:00:31,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9088 conditions, 1378 events. 774/1378 cut-off events. For 92639/92639 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7308 event pairs, 285 based on Foata normal form. 4/1381 useless extension candidates. Maximal degree in co-relation 8954. Up to 1303 conditions per place. [2024-06-14 14:00:31,284 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 239 selfloop transitions, 23 changer transitions 0/264 dead transitions. [2024-06-14 14:00:31,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 264 transitions, 3465 flow [2024-06-14 14:00:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:00:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:00:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:00:31,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-14 14:00:31,284 INFO L175 Difference]: Start difference. First operand has 277 places, 245 transitions, 2643 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:00:31,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 264 transitions, 3465 flow [2024-06-14 14:00:31,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 264 transitions, 3264 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 14:00:31,568 INFO L231 Difference]: Finished difference. Result has 278 places, 250 transitions, 2614 flow [2024-06-14 14:00:31,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2614, PETRI_PLACES=278, PETRI_TRANSITIONS=250} [2024-06-14 14:00:31,569 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 246 predicate places. [2024-06-14 14:00:31,569 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 250 transitions, 2614 flow [2024-06-14 14:00:31,569 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 14:00:31,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:00:31,569 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 14:00:31,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 14:00:31,569 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 14:00:31,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:00:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1078518573, now seen corresponding path program 18 times [2024-06-14 14:00:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:00:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55015441] [2024-06-14 14:00:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:00:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:00:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:00:36,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:00:36,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:00:36,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55015441] [2024-06-14 14:00:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55015441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:00:36,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:00:36,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:00:36,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657431656] [2024-06-14 14:00:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:00:36,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:00:36,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:00:36,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:00:36,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:00:37,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:00:37,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 250 transitions, 2614 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 14:00:37,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:00:37,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:00:37,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:00:37,614 INFO L124 PetriNetUnfolderBase]: 778/1387 cut-off events. [2024-06-14 14:00:37,614 INFO L125 PetriNetUnfolderBase]: For 89497/89497 co-relation queries the response was YES. [2024-06-14 14:00:37,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8999 conditions, 1387 events. 778/1387 cut-off events. For 89497/89497 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7381 event pairs, 107 based on Foata normal form. 2/1383 useless extension candidates. Maximal degree in co-relation 8864. Up to 1117 conditions per place. [2024-06-14 14:00:37,628 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 214 selfloop transitions, 52 changer transitions 0/268 dead transitions. [2024-06-14 14:00:37,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 268 transitions, 3216 flow [2024-06-14 14:00:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:00:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:00:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 14:00:37,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-14 14:00:37,630 INFO L175 Difference]: Start difference. First operand has 278 places, 250 transitions, 2614 flow. Second operand 9 states and 106 transitions. [2024-06-14 14:00:37,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 268 transitions, 3216 flow [2024-06-14 14:00:37,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 268 transitions, 3122 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-14 14:00:37,901 INFO L231 Difference]: Finished difference. Result has 281 places, 251 transitions, 2658 flow [2024-06-14 14:00:37,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2520, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2658, PETRI_PLACES=281, PETRI_TRANSITIONS=251} [2024-06-14 14:00:37,901 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 249 predicate places. [2024-06-14 14:00:37,901 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 251 transitions, 2658 flow [2024-06-14 14:00:37,901 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 14:00:37,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:00:37,901 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 14:00:37,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 14:00:37,901 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 14:00:37,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:00:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash 69068969, now seen corresponding path program 12 times [2024-06-14 14:00:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:00:37,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386651693] [2024-06-14 14:00:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:00:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:00:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:00:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:00:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:00:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386651693] [2024-06-14 14:00:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386651693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:00:45,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:00:45,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:00:45,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187252342] [2024-06-14 14:00:45,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:00:45,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:00:45,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:00:45,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:00:45,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:00:45,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:00:45,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 251 transitions, 2658 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 14:00:45,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:00:45,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:00:45,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:00:46,215 INFO L124 PetriNetUnfolderBase]: 784/1397 cut-off events. [2024-06-14 14:00:46,215 INFO L125 PetriNetUnfolderBase]: For 91321/91321 co-relation queries the response was YES. [2024-06-14 14:00:46,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9111 conditions, 1397 events. 784/1397 cut-off events. For 91321/91321 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7432 event pairs, 110 based on Foata normal form. 2/1393 useless extension candidates. Maximal degree in co-relation 8974. Up to 968 conditions per place. [2024-06-14 14:00:46,229 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 195 selfloop transitions, 76 changer transitions 0/273 dead transitions. [2024-06-14 14:00:46,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 273 transitions, 3294 flow [2024-06-14 14:00:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:00:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:00:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 14:00:46,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:00:46,230 INFO L175 Difference]: Start difference. First operand has 281 places, 251 transitions, 2658 flow. Second operand 10 states and 120 transitions. [2024-06-14 14:00:46,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 273 transitions, 3294 flow [2024-06-14 14:00:46,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 273 transitions, 3166 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:00:46,524 INFO L231 Difference]: Finished difference. Result has 284 places, 253 transitions, 2735 flow [2024-06-14 14:00:46,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2530, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2735, PETRI_PLACES=284, PETRI_TRANSITIONS=253} [2024-06-14 14:00:46,524 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 252 predicate places. [2024-06-14 14:00:46,524 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 253 transitions, 2735 flow [2024-06-14 14:00:46,524 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 14:00:46,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:00:46,524 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 14:00:46,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 14:00:46,525 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 14:00:46,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:00:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -189495267, now seen corresponding path program 3 times [2024-06-14 14:00:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:00:46,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587139931] [2024-06-14 14:00:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:00:46,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:00:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:00:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:00:51,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:00:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587139931] [2024-06-14 14:00:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587139931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:00:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:00:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:00:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071675161] [2024-06-14 14:00:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:00:51,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:00:51,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:00:51,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:00:51,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:00:51,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:00:51,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 253 transitions, 2735 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 14:00:51,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:00:51,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:00:51,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:00:52,313 INFO L124 PetriNetUnfolderBase]: 792/1413 cut-off events. [2024-06-14 14:00:52,313 INFO L125 PetriNetUnfolderBase]: For 100734/100734 co-relation queries the response was YES. [2024-06-14 14:00:52,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9269 conditions, 1413 events. 792/1413 cut-off events. For 100734/100734 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7589 event pairs, 161 based on Foata normal form. 4/1413 useless extension candidates. Maximal degree in co-relation 9131. Up to 1227 conditions per place. [2024-06-14 14:00:52,326 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 215 selfloop transitions, 55 changer transitions 0/272 dead transitions. [2024-06-14 14:00:52,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 272 transitions, 3361 flow [2024-06-14 14:00:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:00:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:00:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 14:00:52,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32231404958677684 [2024-06-14 14:00:52,327 INFO L175 Difference]: Start difference. First operand has 284 places, 253 transitions, 2735 flow. Second operand 11 states and 117 transitions. [2024-06-14 14:00:52,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 272 transitions, 3361 flow [2024-06-14 14:00:52,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 272 transitions, 3176 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 14:00:52,609 INFO L231 Difference]: Finished difference. Result has 287 places, 254 transitions, 2700 flow [2024-06-14 14:00:52,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2550, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2700, PETRI_PLACES=287, PETRI_TRANSITIONS=254} [2024-06-14 14:00:52,609 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 255 predicate places. [2024-06-14 14:00:52,609 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 254 transitions, 2700 flow [2024-06-14 14:00:52,609 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 14:00:52,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:00:52,609 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 14:00:52,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 14:00:52,610 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 14:00:52,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:00:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1073012043, now seen corresponding path program 19 times [2024-06-14 14:00:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:00:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145677763] [2024-06-14 14:00:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:00:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:00:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:00:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:00:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:00:57,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145677763] [2024-06-14 14:00:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145677763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:00:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:00:57,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:00:57,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618032784] [2024-06-14 14:00:57,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:00:57,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:00:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:00:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:00:57,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:00:57,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:00:57,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 254 transitions, 2700 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 14:00:57,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:00:57,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:00:57,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:00:58,449 INFO L124 PetriNetUnfolderBase]: 796/1421 cut-off events. [2024-06-14 14:00:58,449 INFO L125 PetriNetUnfolderBase]: For 96244/96244 co-relation queries the response was YES. [2024-06-14 14:00:58,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9259 conditions, 1421 events. 796/1421 cut-off events. For 96244/96244 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7606 event pairs, 114 based on Foata normal form. 2/1417 useless extension candidates. Maximal degree in co-relation 9120. Up to 1151 conditions per place. [2024-06-14 14:00:58,462 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 215 selfloop transitions, 53 changer transitions 0/270 dead transitions. [2024-06-14 14:00:58,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 270 transitions, 3302 flow [2024-06-14 14:00:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:00:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:00:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 14:00:58,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-14 14:00:58,463 INFO L175 Difference]: Start difference. First operand has 287 places, 254 transitions, 2700 flow. Second operand 9 states and 103 transitions. [2024-06-14 14:00:58,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 270 transitions, 3302 flow [2024-06-14 14:00:58,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 270 transitions, 3162 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-14 14:00:58,828 INFO L231 Difference]: Finished difference. Result has 287 places, 255 transitions, 2702 flow [2024-06-14 14:00:58,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2560, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2702, PETRI_PLACES=287, PETRI_TRANSITIONS=255} [2024-06-14 14:00:58,829 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 255 predicate places. [2024-06-14 14:00:58,829 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 255 transitions, 2702 flow [2024-06-14 14:00:58,829 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 14:00:58,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:00:58,829 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 14:00:58,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 14:00:58,830 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 14:00:58,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:00:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1272463935, now seen corresponding path program 13 times [2024-06-14 14:00:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:00:58,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416107523] [2024-06-14 14:00:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:00:58,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:00:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:01:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:01:07,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:01:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416107523] [2024-06-14 14:01:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416107523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:01:07,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:01:07,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:01:07,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534680415] [2024-06-14 14:01:07,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:01:07,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:01:07,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:01:07,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:01:07,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:01:07,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:01:07,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 255 transitions, 2702 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 14:01:07,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:01:07,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:01:07,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:01:08,098 INFO L124 PetriNetUnfolderBase]: 802/1431 cut-off events. [2024-06-14 14:01:08,099 INFO L125 PetriNetUnfolderBase]: For 98308/98308 co-relation queries the response was YES. [2024-06-14 14:01:08,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9331 conditions, 1431 events. 802/1431 cut-off events. For 98308/98308 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7671 event pairs, 111 based on Foata normal form. 2/1427 useless extension candidates. Maximal degree in co-relation 9191. Up to 1002 conditions per place. [2024-06-14 14:01:08,114 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 199 selfloop transitions, 75 changer transitions 0/276 dead transitions. [2024-06-14 14:01:08,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 276 transitions, 3344 flow [2024-06-14 14:01:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:01:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:01:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 14:01:08,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:01:08,115 INFO L175 Difference]: Start difference. First operand has 287 places, 255 transitions, 2702 flow. Second operand 10 states and 120 transitions. [2024-06-14 14:01:08,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 276 transitions, 3344 flow [2024-06-14 14:01:08,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 276 transitions, 3212 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:01:08,474 INFO L231 Difference]: Finished difference. Result has 290 places, 257 transitions, 2777 flow [2024-06-14 14:01:08,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2570, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2777, PETRI_PLACES=290, PETRI_TRANSITIONS=257} [2024-06-14 14:01:08,475 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 258 predicate places. [2024-06-14 14:01:08,475 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 257 transitions, 2777 flow [2024-06-14 14:01:08,475 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 14:01:08,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:01:08,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:01:08,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 14:01:08,475 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 14:01:08,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:01:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1280092415, now seen corresponding path program 4 times [2024-06-14 14:01:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:01:08,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639981039] [2024-06-14 14:01:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:01:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:01:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:01:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:01:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:01:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639981039] [2024-06-14 14:01:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639981039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:01:13,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:01:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:01:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428410940] [2024-06-14 14:01:13,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:01:13,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:01:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:01:13,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:01:13,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:01:13,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:01:13,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 257 transitions, 2777 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 14:01:13,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:01:13,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:01:13,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:01:14,333 INFO L124 PetriNetUnfolderBase]: 810/1447 cut-off events. [2024-06-14 14:01:14,333 INFO L125 PetriNetUnfolderBase]: For 108522/108522 co-relation queries the response was YES. [2024-06-14 14:01:14,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9483 conditions, 1447 events. 810/1447 cut-off events. For 108522/108522 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7825 event pairs, 175 based on Foata normal form. 4/1447 useless extension candidates. Maximal degree in co-relation 9342. Up to 1261 conditions per place. [2024-06-14 14:01:14,346 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 228 selfloop transitions, 46 changer transitions 0/276 dead transitions. [2024-06-14 14:01:14,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 276 transitions, 3413 flow [2024-06-14 14:01:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:01:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:01:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-14 14:01:14,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3278236914600551 [2024-06-14 14:01:14,348 INFO L175 Difference]: Start difference. First operand has 290 places, 257 transitions, 2777 flow. Second operand 11 states and 119 transitions. [2024-06-14 14:01:14,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 276 transitions, 3413 flow [2024-06-14 14:01:14,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 276 transitions, 3226 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-14 14:01:14,700 INFO L231 Difference]: Finished difference. Result has 293 places, 258 transitions, 2724 flow [2024-06-14 14:01:14,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2590, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2724, PETRI_PLACES=293, PETRI_TRANSITIONS=258} [2024-06-14 14:01:14,701 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 261 predicate places. [2024-06-14 14:01:14,701 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 258 transitions, 2724 flow [2024-06-14 14:01:14,701 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 14:01:14,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:01:14,702 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 14:01:14,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 14:01:14,702 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 14:01:14,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:01:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1073008323, now seen corresponding path program 20 times [2024-06-14 14:01:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:01:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323629730] [2024-06-14 14:01:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:01:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:01:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:01:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:01:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:01:19,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323629730] [2024-06-14 14:01:19,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323629730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:01:19,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:01:19,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:01:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241495759] [2024-06-14 14:01:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:01:19,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:01:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:01:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:01:19,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:01:20,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:01:20,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 258 transitions, 2724 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 14:01:20,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:01:20,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:01:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:01:20,501 INFO L124 PetriNetUnfolderBase]: 807/1442 cut-off events. [2024-06-14 14:01:20,501 INFO L125 PetriNetUnfolderBase]: For 96517/96517 co-relation queries the response was YES. [2024-06-14 14:01:20,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9169 conditions, 1442 events. 807/1442 cut-off events. For 96517/96517 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7748 event pairs, 115 based on Foata normal form. 2/1438 useless extension candidates. Maximal degree in co-relation 9027. Up to 1146 conditions per place. [2024-06-14 14:01:20,517 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 215 selfloop transitions, 56 changer transitions 0/273 dead transitions. [2024-06-14 14:01:20,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 273 transitions, 3302 flow [2024-06-14 14:01:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:01:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:01:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 14:01:20,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-14 14:01:20,518 INFO L175 Difference]: Start difference. First operand has 293 places, 258 transitions, 2724 flow. Second operand 9 states and 103 transitions. [2024-06-14 14:01:20,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 273 transitions, 3302 flow [2024-06-14 14:01:20,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 273 transitions, 3178 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-14 14:01:20,925 INFO L231 Difference]: Finished difference. Result has 293 places, 258 transitions, 2716 flow [2024-06-14 14:01:20,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2600, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2716, PETRI_PLACES=293, PETRI_TRANSITIONS=258} [2024-06-14 14:01:20,926 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 261 predicate places. [2024-06-14 14:01:20,926 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 258 transitions, 2716 flow [2024-06-14 14:01:20,926 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 14:01:20,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:01:20,926 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 14:01:20,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 14:01:20,926 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 14:01:20,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:01:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -757732195, now seen corresponding path program 5 times [2024-06-14 14:01:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:01:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99792780] [2024-06-14 14:01:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:01:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:01:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:01:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:01:26,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:01:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99792780] [2024-06-14 14:01:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99792780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:01:26,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:01:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:01:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233681547] [2024-06-14 14:01:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:01:26,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:01:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:01:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:01:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:01:26,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:01:26,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 258 transitions, 2716 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 14:01:26,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:01:26,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:01:26,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:01:26,764 INFO L124 PetriNetUnfolderBase]: 829/1483 cut-off events. [2024-06-14 14:01:26,764 INFO L125 PetriNetUnfolderBase]: For 120425/120425 co-relation queries the response was YES. [2024-06-14 14:01:26,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9788 conditions, 1483 events. 829/1483 cut-off events. For 120425/120425 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 8064 event pairs, 302 based on Foata normal form. 4/1486 useless extension candidates. Maximal degree in co-relation 9645. Up to 1383 conditions per place. [2024-06-14 14:01:26,781 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 254 selfloop transitions, 19 changer transitions 0/275 dead transitions. [2024-06-14 14:01:26,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 275 transitions, 3542 flow [2024-06-14 14:01:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:01:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:01:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-14 14:01:26,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31212121212121213 [2024-06-14 14:01:26,782 INFO L175 Difference]: Start difference. First operand has 293 places, 258 transitions, 2716 flow. Second operand 10 states and 103 transitions. [2024-06-14 14:01:26,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 275 transitions, 3542 flow [2024-06-14 14:01:27,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 275 transitions, 3315 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-14 14:01:27,214 INFO L231 Difference]: Finished difference. Result has 294 places, 260 transitions, 2609 flow [2024-06-14 14:01:27,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2489, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2609, PETRI_PLACES=294, PETRI_TRANSITIONS=260} [2024-06-14 14:01:27,215 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 262 predicate places. [2024-06-14 14:01:27,215 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 260 transitions, 2609 flow [2024-06-14 14:01:27,215 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 14:01:27,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:01:27,216 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 14:01:27,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 14:01:27,216 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 14:01:27,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:01:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1338439873, now seen corresponding path program 14 times [2024-06-14 14:01:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:01:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458808485] [2024-06-14 14:01:27,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:01:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:01:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:01:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:01:35,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:01:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458808485] [2024-06-14 14:01:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458808485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:01:35,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:01:35,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:01:35,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988470073] [2024-06-14 14:01:35,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:01:35,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:01:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:01:35,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:01:35,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:01:35,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:01:35,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 260 transitions, 2609 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 14:01:35,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:01:35,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:01:35,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:01:36,168 INFO L124 PetriNetUnfolderBase]: 835/1494 cut-off events. [2024-06-14 14:01:36,168 INFO L125 PetriNetUnfolderBase]: For 115803/115803 co-relation queries the response was YES. [2024-06-14 14:01:36,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 1494 events. 835/1494 cut-off events. For 115803/115803 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8116 event pairs, 104 based on Foata normal form. 2/1490 useless extension candidates. Maximal degree in co-relation 9453. Up to 1044 conditions per place. [2024-06-14 14:01:36,186 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 197 selfloop transitions, 87 changer transitions 0/286 dead transitions. [2024-06-14 14:01:36,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 286 transitions, 3521 flow [2024-06-14 14:01:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:01:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:01:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 14:01:36,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2024-06-14 14:01:36,187 INFO L175 Difference]: Start difference. First operand has 294 places, 260 transitions, 2609 flow. Second operand 10 states and 122 transitions. [2024-06-14 14:01:36,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 286 transitions, 3521 flow [2024-06-14 14:01:36,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 286 transitions, 3383 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-14 14:01:36,573 INFO L231 Difference]: Finished difference. Result has 296 places, 264 transitions, 2778 flow [2024-06-14 14:01:36,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2479, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2778, PETRI_PLACES=296, PETRI_TRANSITIONS=264} [2024-06-14 14:01:36,574 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 264 predicate places. [2024-06-14 14:01:36,574 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 264 transitions, 2778 flow [2024-06-14 14:01:36,574 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 14:01:36,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:01:36,574 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 14:01:36,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 14:01:36,574 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 14:01:36,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:01:36,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1073162145, now seen corresponding path program 15 times [2024-06-14 14:01:36,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:01:36,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582197463] [2024-06-14 14:01:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:01:36,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:01:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:01:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:01:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:01:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582197463] [2024-06-14 14:01:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582197463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:01:44,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:01:44,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:01:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67850816] [2024-06-14 14:01:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:01:44,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:01:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:01:44,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:01:44,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:01:44,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:01:44,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 264 transitions, 2778 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 14:01:44,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:01:44,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:01:44,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:01:45,349 INFO L124 PetriNetUnfolderBase]: 831/1488 cut-off events. [2024-06-14 14:01:45,349 INFO L125 PetriNetUnfolderBase]: For 105776/105776 co-relation queries the response was YES. [2024-06-14 14:01:45,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9348 conditions, 1488 events. 831/1488 cut-off events. For 105776/105776 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8080 event pairs, 128 based on Foata normal form. 2/1484 useless extension candidates. Maximal degree in co-relation 9205. Up to 1059 conditions per place. [2024-06-14 14:01:45,361 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 201 selfloop transitions, 78 changer transitions 0/281 dead transitions. [2024-06-14 14:01:45,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 281 transitions, 3376 flow [2024-06-14 14:01:45,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:01:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:01:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 14:01:45,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-14 14:01:45,363 INFO L175 Difference]: Start difference. First operand has 296 places, 264 transitions, 2778 flow. Second operand 10 states and 116 transitions. [2024-06-14 14:01:45,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 281 transitions, 3376 flow [2024-06-14 14:01:45,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 281 transitions, 3166 flow, removed 52 selfloop flow, removed 6 redundant places. [2024-06-14 14:01:45,784 INFO L231 Difference]: Finished difference. Result has 300 places, 264 transitions, 2729 flow [2024-06-14 14:01:45,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2568, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2729, PETRI_PLACES=300, PETRI_TRANSITIONS=264} [2024-06-14 14:01:45,785 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 268 predicate places. [2024-06-14 14:01:45,785 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 264 transitions, 2729 flow [2024-06-14 14:01:45,785 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 14:01:45,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:01:45,785 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 14:01:45,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 14:01:45,785 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 14:01:45,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:01:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1338447313, now seen corresponding path program 16 times [2024-06-14 14:01:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:01:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657634671] [2024-06-14 14:01:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:01:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:01:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:01:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:01:52,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:01:52,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657634671] [2024-06-14 14:01:52,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657634671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:01:52,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:01:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:01:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489480208] [2024-06-14 14:01:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:01:52,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:01:52,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:01:52,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:01:52,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:01:52,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:01:52,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 264 transitions, 2729 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 14:01:52,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:01:52,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:01:52,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:01:53,639 INFO L124 PetriNetUnfolderBase]: 837/1498 cut-off events. [2024-06-14 14:01:53,639 INFO L125 PetriNetUnfolderBase]: For 107421/107421 co-relation queries the response was YES. [2024-06-14 14:01:53,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9436 conditions, 1498 events. 837/1498 cut-off events. For 107421/107421 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8158 event pairs, 104 based on Foata normal form. 2/1494 useless extension candidates. Maximal degree in co-relation 9291. Up to 1069 conditions per place. [2024-06-14 14:01:53,654 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 200 selfloop transitions, 84 changer transitions 0/286 dead transitions. [2024-06-14 14:01:53,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 286 transitions, 3393 flow [2024-06-14 14:01:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:01:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:01:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 14:01:53,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2024-06-14 14:01:53,655 INFO L175 Difference]: Start difference. First operand has 300 places, 264 transitions, 2729 flow. Second operand 10 states and 119 transitions. [2024-06-14 14:01:53,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 286 transitions, 3393 flow [2024-06-14 14:01:54,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 286 transitions, 3218 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 14:01:54,036 INFO L231 Difference]: Finished difference. Result has 301 places, 266 transitions, 2777 flow [2024-06-14 14:01:54,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2554, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2777, PETRI_PLACES=301, PETRI_TRANSITIONS=266} [2024-06-14 14:01:54,037 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 269 predicate places. [2024-06-14 14:01:54,037 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 266 transitions, 2777 flow [2024-06-14 14:01:54,037 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 14:01:54,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:01:54,038 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 14:01:54,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 14:01:54,038 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 14:01:54,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:01:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash 961524109, now seen corresponding path program 6 times [2024-06-14 14:01:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:01:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045094451] [2024-06-14 14:01:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:01:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:01:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:01:58,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 14:01:58,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:01:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045094451] [2024-06-14 14:01:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045094451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:01:58,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:01:58,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:01:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700586578] [2024-06-14 14:01:58,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:01:58,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:01:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:01:58,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:01:58,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:01:58,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:01:58,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 266 transitions, 2777 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 14:01:58,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:01:58,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:01:58,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:01:59,393 INFO L124 PetriNetUnfolderBase]: 845/1513 cut-off events. [2024-06-14 14:01:59,393 INFO L125 PetriNetUnfolderBase]: For 117875/117875 co-relation queries the response was YES. [2024-06-14 14:01:59,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9581 conditions, 1513 events. 845/1513 cut-off events. For 117875/117875 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8297 event pairs, 311 based on Foata normal form. 4/1516 useless extension candidates. Maximal degree in co-relation 9435. Up to 1447 conditions per place. [2024-06-14 14:01:59,410 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 258 selfloop transitions, 20 changer transitions 0/280 dead transitions. [2024-06-14 14:01:59,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 280 transitions, 3401 flow [2024-06-14 14:01:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:01:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:01:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-14 14:01:59,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31212121212121213 [2024-06-14 14:01:59,413 INFO L175 Difference]: Start difference. First operand has 301 places, 266 transitions, 2777 flow. Second operand 10 states and 103 transitions. [2024-06-14 14:01:59,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 280 transitions, 3401 flow [2024-06-14 14:01:59,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 280 transitions, 3198 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 14:01:59,811 INFO L231 Difference]: Finished difference. Result has 303 places, 267 transitions, 2654 flow [2024-06-14 14:01:59,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2574, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2654, PETRI_PLACES=303, PETRI_TRANSITIONS=267} [2024-06-14 14:01:59,812 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 271 predicate places. [2024-06-14 14:01:59,812 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 267 transitions, 2654 flow [2024-06-14 14:01:59,812 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 14:01:59,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:01:59,813 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 14:01:59,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 14:01:59,813 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 14:01:59,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:01:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1190215333, now seen corresponding path program 7 times [2024-06-14 14:01:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:01:59,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413950420] [2024-06-14 14:01:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:01:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:01:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:02:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:02:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:02:05,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413950420] [2024-06-14 14:02:05,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413950420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:02:05,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:02:05,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:02:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579550381] [2024-06-14 14:02:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:02:05,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:02:05,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:02:05,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:02:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:02:05,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:02:05,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 267 transitions, 2654 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 14:02:05,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:02:05,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:02:05,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:02:06,376 INFO L124 PetriNetUnfolderBase]: 839/1503 cut-off events. [2024-06-14 14:02:06,376 INFO L125 PetriNetUnfolderBase]: For 105041/105041 co-relation queries the response was YES. [2024-06-14 14:02:06,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8976 conditions, 1503 events. 839/1503 cut-off events. For 105041/105041 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8238 event pairs, 305 based on Foata normal form. 4/1506 useless extension candidates. Maximal degree in co-relation 8829. Up to 1421 conditions per place. [2024-06-14 14:02:06,389 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 258 selfloop transitions, 21 changer transitions 0/281 dead transitions. [2024-06-14 14:02:06,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 281 transitions, 3248 flow [2024-06-14 14:02:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:02:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:02:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-14 14:02:06,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2024-06-14 14:02:06,390 INFO L175 Difference]: Start difference. First operand has 303 places, 267 transitions, 2654 flow. Second operand 11 states and 110 transitions. [2024-06-14 14:02:06,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 281 transitions, 3248 flow [2024-06-14 14:02:06,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 281 transitions, 3150 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-14 14:02:06,752 INFO L231 Difference]: Finished difference. Result has 306 places, 267 transitions, 2604 flow [2024-06-14 14:02:06,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2604, PETRI_PLACES=306, PETRI_TRANSITIONS=267} [2024-06-14 14:02:06,753 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 274 predicate places. [2024-06-14 14:02:06,753 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 267 transitions, 2604 flow [2024-06-14 14:02:06,753 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 14:02:06,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:02:06,754 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 14:02:06,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 14:02:06,754 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 14:02:06,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:02:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1338649123, now seen corresponding path program 17 times [2024-06-14 14:02:06,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:02:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165928544] [2024-06-14 14:02:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:02:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:02:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:02:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:02:15,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:02:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165928544] [2024-06-14 14:02:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165928544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:02:15,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:02:15,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:02:15,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399591324] [2024-06-14 14:02:15,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:02:15,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:02:15,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:02:15,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:02:15,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:02:15,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:02:15,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 267 transitions, 2604 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 14:02:15,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:02:15,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:02:15,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:02:16,084 INFO L124 PetriNetUnfolderBase]: 835/1498 cut-off events. [2024-06-14 14:02:16,084 INFO L125 PetriNetUnfolderBase]: For 91328/91328 co-relation queries the response was YES. [2024-06-14 14:02:16,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8677 conditions, 1498 events. 835/1498 cut-off events. For 91328/91328 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8186 event pairs, 106 based on Foata normal form. 2/1494 useless extension candidates. Maximal degree in co-relation 8529. Up to 1069 conditions per place. [2024-06-14 14:02:16,100 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 198 selfloop transitions, 85 changer transitions 0/285 dead transitions. [2024-06-14 14:02:16,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 285 transitions, 3214 flow [2024-06-14 14:02:16,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:02:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:02:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 14:02:16,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-14 14:02:16,101 INFO L175 Difference]: Start difference. First operand has 306 places, 267 transitions, 2604 flow. Second operand 10 states and 116 transitions. [2024-06-14 14:02:16,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 285 transitions, 3214 flow [2024-06-14 14:02:16,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 285 transitions, 3126 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-14 14:02:16,475 INFO L231 Difference]: Finished difference. Result has 306 places, 267 transitions, 2691 flow [2024-06-14 14:02:16,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2691, PETRI_PLACES=306, PETRI_TRANSITIONS=267} [2024-06-14 14:02:16,476 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 274 predicate places. [2024-06-14 14:02:16,476 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 267 transitions, 2691 flow [2024-06-14 14:02:16,476 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 14:02:16,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:02:16,476 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 14:02:16,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 14:02:16,477 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 14:02:16,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:02:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash 938561589, now seen corresponding path program 8 times [2024-06-14 14:02:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:02:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523987605] [2024-06-14 14:02:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:02:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:02:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:02:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:02:21,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:02:21,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523987605] [2024-06-14 14:02:21,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523987605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:02:21,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:02:21,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:02:21,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620497466] [2024-06-14 14:02:21,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:02:21,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:02:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:02:21,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:02:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:02:21,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:02:21,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 267 transitions, 2691 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 14:02:21,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:02:21,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:02:21,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:02:22,389 INFO L124 PetriNetUnfolderBase]: 836/1501 cut-off events. [2024-06-14 14:02:22,389 INFO L125 PetriNetUnfolderBase]: For 92812/92812 co-relation queries the response was YES. [2024-06-14 14:02:22,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8710 conditions, 1501 events. 836/1501 cut-off events. For 92812/92812 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8285 event pairs, 175 based on Foata normal form. 4/1501 useless extension candidates. Maximal degree in co-relation 8561. Up to 1315 conditions per place. [2024-06-14 14:02:22,402 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 234 selfloop transitions, 50 changer transitions 0/286 dead transitions. [2024-06-14 14:02:22,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 286 transitions, 3349 flow [2024-06-14 14:02:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:02:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:02:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 14:02:22,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325068870523416 [2024-06-14 14:02:22,403 INFO L175 Difference]: Start difference. First operand has 306 places, 267 transitions, 2691 flow. Second operand 11 states and 118 transitions. [2024-06-14 14:02:22,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 286 transitions, 3349 flow [2024-06-14 14:02:22,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 286 transitions, 3167 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 14:02:22,754 INFO L231 Difference]: Finished difference. Result has 308 places, 268 transitions, 2653 flow [2024-06-14 14:02:22,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2509, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2653, PETRI_PLACES=308, PETRI_TRANSITIONS=268} [2024-06-14 14:02:22,755 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 276 predicate places. [2024-06-14 14:02:22,755 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 268 transitions, 2653 flow [2024-06-14 14:02:22,755 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 14:02:22,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:02:22,755 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 14:02:22,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 14:02:22,755 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 14:02:22,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:02:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash -959961263, now seen corresponding path program 1 times [2024-06-14 14:02:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:02:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253025400] [2024-06-14 14:02:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:02:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:02:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:02:28,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 14:02:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:02:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253025400] [2024-06-14 14:02:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253025400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:02:28,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:02:28,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:02:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072385950] [2024-06-14 14:02:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:02:28,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:02:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:02:28,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:02:28,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:02:28,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:02:28,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 268 transitions, 2653 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 14:02:28,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:02:28,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:02:28,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:02:29,305 INFO L124 PetriNetUnfolderBase]: 840/1508 cut-off events. [2024-06-14 14:02:29,305 INFO L125 PetriNetUnfolderBase]: For 86283/86283 co-relation queries the response was YES. [2024-06-14 14:02:29,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8643 conditions, 1508 events. 840/1508 cut-off events. For 86283/86283 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 8280 event pairs, 204 based on Foata normal form. 2/1509 useless extension candidates. Maximal degree in co-relation 8493. Up to 1357 conditions per place. [2024-06-14 14:02:29,321 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 250 selfloop transitions, 35 changer transitions 0/287 dead transitions. [2024-06-14 14:02:29,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 287 transitions, 3277 flow [2024-06-14 14:02:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:02:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:02:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 14:02:29,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2024-06-14 14:02:29,323 INFO L175 Difference]: Start difference. First operand has 308 places, 268 transitions, 2653 flow. Second operand 10 states and 108 transitions. [2024-06-14 14:02:29,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 287 transitions, 3277 flow [2024-06-14 14:02:29,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 287 transitions, 3143 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 14:02:29,629 INFO L231 Difference]: Finished difference. Result has 309 places, 269 transitions, 2608 flow [2024-06-14 14:02:29,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2519, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2608, PETRI_PLACES=309, PETRI_TRANSITIONS=269} [2024-06-14 14:02:29,629 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 277 predicate places. [2024-06-14 14:02:29,629 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 269 transitions, 2608 flow [2024-06-14 14:02:29,629 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 14:02:29,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:02:29,629 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 14:02:29,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 14:02:29,629 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 14:02:29,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:02:29,630 INFO L85 PathProgramCache]: Analyzing trace with hash -702205617, now seen corresponding path program 2 times [2024-06-14 14:02:29,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:02:29,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797979059] [2024-06-14 14:02:29,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:02:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:02:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:02:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:02:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:02:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797979059] [2024-06-14 14:02:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797979059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:02:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:02:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:02:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443443676] [2024-06-14 14:02:35,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:02:35,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:02:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:02:35,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:02:35,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:02:35,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:02:35,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 269 transitions, 2608 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 14:02:35,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:02:35,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:02:35,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:02:36,014 INFO L124 PetriNetUnfolderBase]: 844/1516 cut-off events. [2024-06-14 14:02:36,014 INFO L125 PetriNetUnfolderBase]: For 87963/87963 co-relation queries the response was YES. [2024-06-14 14:02:36,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8622 conditions, 1516 events. 844/1516 cut-off events. For 87963/87963 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 8358 event pairs, 197 based on Foata normal form. 2/1517 useless extension candidates. Maximal degree in co-relation 8471. Up to 1407 conditions per place. [2024-06-14 14:02:36,031 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 267 selfloop transitions, 23 changer transitions 0/292 dead transitions. [2024-06-14 14:02:36,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 292 transitions, 3256 flow [2024-06-14 14:02:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:02:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:02:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 14:02:36,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-06-14 14:02:36,032 INFO L175 Difference]: Start difference. First operand has 309 places, 269 transitions, 2608 flow. Second operand 11 states and 116 transitions. [2024-06-14 14:02:36,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 292 transitions, 3256 flow [2024-06-14 14:02:36,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 292 transitions, 3179 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 14:02:36,343 INFO L231 Difference]: Finished difference. Result has 312 places, 270 transitions, 2597 flow [2024-06-14 14:02:36,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2531, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2597, PETRI_PLACES=312, PETRI_TRANSITIONS=270} [2024-06-14 14:02:36,343 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 280 predicate places. [2024-06-14 14:02:36,343 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 270 transitions, 2597 flow [2024-06-14 14:02:36,343 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 14:02:36,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:02:36,343 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 14:02:36,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 14:02:36,344 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 14:02:36,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:02:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1433924403, now seen corresponding path program 3 times [2024-06-14 14:02:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:02:36,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719816143] [2024-06-14 14:02:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:02:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:02:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:02:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:02:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:02:42,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719816143] [2024-06-14 14:02:42,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719816143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:02:42,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:02:42,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:02:42,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39908491] [2024-06-14 14:02:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:02:42,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:02:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:02:42,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:02:42,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:02:42,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:02:42,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 270 transitions, 2597 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 14:02:42,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:02:42,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:02:42,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:02:43,037 INFO L124 PetriNetUnfolderBase]: 858/1542 cut-off events. [2024-06-14 14:02:43,037 INFO L125 PetriNetUnfolderBase]: For 89105/89105 co-relation queries the response was YES. [2024-06-14 14:02:43,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8735 conditions, 1542 events. 858/1542 cut-off events. For 89105/89105 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 8571 event pairs, 202 based on Foata normal form. 2/1543 useless extension candidates. Maximal degree in co-relation 8583. Up to 1423 conditions per place. [2024-06-14 14:02:43,054 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 266 selfloop transitions, 27 changer transitions 0/295 dead transitions. [2024-06-14 14:02:43,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 295 transitions, 3280 flow [2024-06-14 14:02:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:02:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:02:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-14 14:02:43,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3278236914600551 [2024-06-14 14:02:43,056 INFO L175 Difference]: Start difference. First operand has 312 places, 270 transitions, 2597 flow. Second operand 11 states and 119 transitions. [2024-06-14 14:02:43,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 295 transitions, 3280 flow [2024-06-14 14:02:43,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 295 transitions, 3224 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 14:02:43,428 INFO L231 Difference]: Finished difference. Result has 316 places, 274 transitions, 2662 flow [2024-06-14 14:02:43,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2541, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2662, PETRI_PLACES=316, PETRI_TRANSITIONS=274} [2024-06-14 14:02:43,428 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 284 predicate places. [2024-06-14 14:02:43,429 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 274 transitions, 2662 flow [2024-06-14 14:02:43,429 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 14:02:43,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:02:43,429 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 14:02:43,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 14:02:43,429 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 14:02:43,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:02:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1442746383, now seen corresponding path program 4 times [2024-06-14 14:02:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:02:43,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92029849] [2024-06-14 14:02:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:02:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:02:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:02:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:02:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:02:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92029849] [2024-06-14 14:02:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92029849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:02:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:02:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:02:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313342377] [2024-06-14 14:02:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:02:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:02:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:02:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:02:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:02:49,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:02:49,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 274 transitions, 2662 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 14:02:49,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:02:49,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:02:49,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:02:50,248 INFO L124 PetriNetUnfolderBase]: 862/1550 cut-off events. [2024-06-14 14:02:50,248 INFO L125 PetriNetUnfolderBase]: For 91853/91853 co-relation queries the response was YES. [2024-06-14 14:02:50,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 1550 events. 862/1550 cut-off events. For 91853/91853 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8622 event pairs, 199 based on Foata normal form. 2/1551 useless extension candidates. Maximal degree in co-relation 8677. Up to 1409 conditions per place. [2024-06-14 14:02:50,265 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 266 selfloop transitions, 28 changer transitions 0/296 dead transitions. [2024-06-14 14:02:50,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 296 transitions, 3318 flow [2024-06-14 14:02:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:02:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:02:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-14 14:02:50,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3305785123966942 [2024-06-14 14:02:50,266 INFO L175 Difference]: Start difference. First operand has 316 places, 274 transitions, 2662 flow. Second operand 11 states and 120 transitions. [2024-06-14 14:02:50,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 296 transitions, 3318 flow [2024-06-14 14:02:50,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 296 transitions, 3260 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 14:02:50,823 INFO L231 Difference]: Finished difference. Result has 320 places, 275 transitions, 2684 flow [2024-06-14 14:02:50,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2604, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2684, PETRI_PLACES=320, PETRI_TRANSITIONS=275} [2024-06-14 14:02:50,824 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 288 predicate places. [2024-06-14 14:02:50,824 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 275 transitions, 2684 flow [2024-06-14 14:02:50,824 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 14:02:50,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:02:50,824 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 14:02:50,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 14:02:50,824 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 14:02:50,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:02:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 486094519, now seen corresponding path program 5 times [2024-06-14 14:02:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:02:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646669942] [2024-06-14 14:02:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:02:50,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:02:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:02:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:02:56,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:02:56,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646669942] [2024-06-14 14:02:56,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646669942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:02:56,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:02:56,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:02:56,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989839212] [2024-06-14 14:02:56,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:02:56,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:02:56,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:02:56,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:02:56,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:02:57,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:02:57,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 275 transitions, 2684 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 14:02:57,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:02:57,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:02:57,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:02:57,615 INFO L124 PetriNetUnfolderBase]: 866/1558 cut-off events. [2024-06-14 14:02:57,616 INFO L125 PetriNetUnfolderBase]: For 93993/93993 co-relation queries the response was YES. [2024-06-14 14:02:57,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8903 conditions, 1558 events. 866/1558 cut-off events. For 93993/93993 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8677 event pairs, 179 based on Foata normal form. 2/1559 useless extension candidates. Maximal degree in co-relation 8747. Up to 1414 conditions per place. [2024-06-14 14:02:57,633 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 269 selfloop transitions, 26 changer transitions 0/297 dead transitions. [2024-06-14 14:02:57,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 297 transitions, 3344 flow [2024-06-14 14:02:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:02:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:02:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-14 14:02:57,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31129476584022037 [2024-06-14 14:02:57,634 INFO L175 Difference]: Start difference. First operand has 320 places, 275 transitions, 2684 flow. Second operand 11 states and 113 transitions. [2024-06-14 14:02:57,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 297 transitions, 3344 flow [2024-06-14 14:02:58,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 297 transitions, 3274 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 14:02:58,026 INFO L231 Difference]: Finished difference. Result has 322 places, 276 transitions, 2692 flow [2024-06-14 14:02:58,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2614, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2692, PETRI_PLACES=322, PETRI_TRANSITIONS=276} [2024-06-14 14:02:58,027 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 290 predicate places. [2024-06-14 14:02:58,027 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 276 transitions, 2692 flow [2024-06-14 14:02:58,027 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 14:02:58,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:02:58,027 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 14:02:58,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 14:02:58,027 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 14:02:58,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:02:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 555521013, now seen corresponding path program 1 times [2024-06-14 14:02:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:02:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300859544] [2024-06-14 14:02:58,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:02:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:02:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:03:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:03:04,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:03:04,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300859544] [2024-06-14 14:03:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300859544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:03:04,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:03:04,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:03:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517159372] [2024-06-14 14:03:04,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:03:04,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:03:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:03:04,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:03:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:03:04,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:03:04,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 276 transitions, 2692 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 14:03:04,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:03:04,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:03:04,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:03:04,969 INFO L124 PetriNetUnfolderBase]: 878/1578 cut-off events. [2024-06-14 14:03:04,969 INFO L125 PetriNetUnfolderBase]: For 96701/96701 co-relation queries the response was YES. [2024-06-14 14:03:04,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9020 conditions, 1578 events. 878/1578 cut-off events. For 96701/96701 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 8823 event pairs, 208 based on Foata normal form. 2/1579 useless extension candidates. Maximal degree in co-relation 8863. Up to 1463 conditions per place. [2024-06-14 14:03:04,987 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 272 selfloop transitions, 29 changer transitions 0/303 dead transitions. [2024-06-14 14:03:04,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 303 transitions, 3410 flow [2024-06-14 14:03:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:03:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:03:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-14 14:03:04,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-14 14:03:04,988 INFO L175 Difference]: Start difference. First operand has 322 places, 276 transitions, 2692 flow. Second operand 12 states and 128 transitions. [2024-06-14 14:03:04,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 303 transitions, 3410 flow [2024-06-14 14:03:05,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 303 transitions, 3342 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 14:03:05,412 INFO L231 Difference]: Finished difference. Result has 326 places, 280 transitions, 2760 flow [2024-06-14 14:03:05,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2624, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2760, PETRI_PLACES=326, PETRI_TRANSITIONS=280} [2024-06-14 14:03:05,412 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 294 predicate places. [2024-06-14 14:03:05,412 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 280 transitions, 2760 flow [2024-06-14 14:03:05,413 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 14:03:05,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:03:05,413 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 14:03:05,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 14:03:05,413 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 14:03:05,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:03:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1021612535, now seen corresponding path program 6 times [2024-06-14 14:03:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:03:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110604114] [2024-06-14 14:03:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:03:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:03:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:03:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:03:10,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:03:10,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110604114] [2024-06-14 14:03:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110604114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:03:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:03:10,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:03:10,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144227574] [2024-06-14 14:03:10,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:03:10,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:03:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:03:10,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:03:10,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:03:11,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:03:11,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 280 transitions, 2760 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 14:03:11,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:03:11,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:03:11,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:03:11,701 INFO L124 PetriNetUnfolderBase]: 886/1594 cut-off events. [2024-06-14 14:03:11,701 INFO L125 PetriNetUnfolderBase]: For 97891/97891 co-relation queries the response was YES. [2024-06-14 14:03:11,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9131 conditions, 1594 events. 886/1594 cut-off events. For 97891/97891 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8927 event pairs, 182 based on Foata normal form. 2/1595 useless extension candidates. Maximal degree in co-relation 8972. Up to 1475 conditions per place. [2024-06-14 14:03:11,720 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 274 selfloop transitions, 27 changer transitions 0/303 dead transitions. [2024-06-14 14:03:11,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 303 transitions, 3440 flow [2024-06-14 14:03:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:03:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:03:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 14:03:11,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 14:03:11,721 INFO L175 Difference]: Start difference. First operand has 326 places, 280 transitions, 2760 flow. Second operand 11 states and 121 transitions. [2024-06-14 14:03:11,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 303 transitions, 3440 flow [2024-06-14 14:03:12,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 303 transitions, 3343 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-14 14:03:12,212 INFO L231 Difference]: Finished difference. Result has 329 places, 282 transitions, 2757 flow [2024-06-14 14:03:12,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2663, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2757, PETRI_PLACES=329, PETRI_TRANSITIONS=282} [2024-06-14 14:03:12,212 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 297 predicate places. [2024-06-14 14:03:12,212 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 282 transitions, 2757 flow [2024-06-14 14:03:12,212 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 14:03:12,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:03:12,213 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 14:03:12,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 14:03:12,213 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 14:03:12,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:03:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash -854752229, now seen corresponding path program 7 times [2024-06-14 14:03:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:03:12,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591116420] [2024-06-14 14:03:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:03:12,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:03:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:03:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:03:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:03:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591116420] [2024-06-14 14:03:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591116420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:03:17,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:03:17,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:03:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084094467] [2024-06-14 14:03:17,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:03:17,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:03:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:03:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:03:17,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:03:17,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:03:17,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 282 transitions, 2757 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 14:03:17,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:03:17,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:03:17,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:03:18,495 INFO L124 PetriNetUnfolderBase]: 890/1602 cut-off events. [2024-06-14 14:03:18,495 INFO L125 PetriNetUnfolderBase]: For 100935/100935 co-relation queries the response was YES. [2024-06-14 14:03:18,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9178 conditions, 1602 events. 890/1602 cut-off events. For 100935/100935 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8991 event pairs, 182 based on Foata normal form. 2/1603 useless extension candidates. Maximal degree in co-relation 9017. Up to 1461 conditions per place. [2024-06-14 14:03:18,512 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 274 selfloop transitions, 28 changer transitions 0/304 dead transitions. [2024-06-14 14:03:18,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 304 transitions, 3435 flow [2024-06-14 14:03:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:03:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:03:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-14 14:03:18,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33608815426997246 [2024-06-14 14:03:18,513 INFO L175 Difference]: Start difference. First operand has 329 places, 282 transitions, 2757 flow. Second operand 11 states and 122 transitions. [2024-06-14 14:03:18,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 304 transitions, 3435 flow [2024-06-14 14:03:18,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 304 transitions, 3361 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 14:03:18,993 INFO L231 Difference]: Finished difference. Result has 332 places, 283 transitions, 2769 flow [2024-06-14 14:03:18,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2683, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2769, PETRI_PLACES=332, PETRI_TRANSITIONS=283} [2024-06-14 14:03:18,994 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 300 predicate places. [2024-06-14 14:03:18,994 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 283 transitions, 2769 flow [2024-06-14 14:03:18,994 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 14:03:18,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:03:18,994 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 14:03:18,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 14:03:18,994 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 14:03:18,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:03:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash 963404765, now seen corresponding path program 8 times [2024-06-14 14:03:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:03:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144520504] [2024-06-14 14:03:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:03:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:03:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:03:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:03:24,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:03:24,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144520504] [2024-06-14 14:03:24,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144520504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:03:24,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:03:24,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:03:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711441793] [2024-06-14 14:03:24,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:03:24,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:03:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:03:24,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:03:24,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:03:24,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:03:24,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 283 transitions, 2769 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 14:03:24,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:03:24,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:03:24,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:03:25,321 INFO L124 PetriNetUnfolderBase]: 894/1610 cut-off events. [2024-06-14 14:03:25,322 INFO L125 PetriNetUnfolderBase]: For 103313/103313 co-relation queries the response was YES. [2024-06-14 14:03:25,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9230 conditions, 1610 events. 894/1610 cut-off events. For 103313/103313 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 9056 event pairs, 179 based on Foata normal form. 2/1611 useless extension candidates. Maximal degree in co-relation 9069. Up to 1398 conditions per place. [2024-06-14 14:03:25,339 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 267 selfloop transitions, 33 changer transitions 0/302 dead transitions. [2024-06-14 14:03:25,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 302 transitions, 3437 flow [2024-06-14 14:03:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:03:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:03:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-14 14:03:25,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3151515151515151 [2024-06-14 14:03:25,340 INFO L175 Difference]: Start difference. First operand has 332 places, 283 transitions, 2769 flow. Second operand 10 states and 104 transitions. [2024-06-14 14:03:25,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 302 transitions, 3437 flow [2024-06-14 14:03:25,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 302 transitions, 3361 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 14:03:25,859 INFO L231 Difference]: Finished difference. Result has 333 places, 284 transitions, 2796 flow [2024-06-14 14:03:25,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2693, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2796, PETRI_PLACES=333, PETRI_TRANSITIONS=284} [2024-06-14 14:03:25,859 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 301 predicate places. [2024-06-14 14:03:25,859 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 284 transitions, 2796 flow [2024-06-14 14:03:25,859 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 14:03:25,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:03:25,859 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 14:03:25,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 14:03:25,860 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 14:03:25,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:03:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -581255427, now seen corresponding path program 2 times [2024-06-14 14:03:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:03:25,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108257849] [2024-06-14 14:03:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:03:25,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:03:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:03:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:03:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:03:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108257849] [2024-06-14 14:03:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108257849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:03:33,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:03:33,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:03:33,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808061958] [2024-06-14 14:03:33,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:03:33,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:03:33,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:03:33,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:03:33,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:03:33,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:03:33,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 284 transitions, 2796 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 14:03:33,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:03:33,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:03:33,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:03:34,068 INFO L124 PetriNetUnfolderBase]: 900/1620 cut-off events. [2024-06-14 14:03:34,068 INFO L125 PetriNetUnfolderBase]: For 105211/105211 co-relation queries the response was YES. [2024-06-14 14:03:34,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9344 conditions, 1620 events. 900/1620 cut-off events. For 105211/105211 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 9130 event pairs, 218 based on Foata normal form. 2/1621 useless extension candidates. Maximal degree in co-relation 9182. Up to 1429 conditions per place. [2024-06-14 14:03:34,087 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 258 selfloop transitions, 46 changer transitions 0/306 dead transitions. [2024-06-14 14:03:34,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 306 transitions, 3502 flow [2024-06-14 14:03:34,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:03:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:03:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 14:03:34,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325068870523416 [2024-06-14 14:03:34,088 INFO L175 Difference]: Start difference. First operand has 333 places, 284 transitions, 2796 flow. Second operand 11 states and 118 transitions. [2024-06-14 14:03:34,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 306 transitions, 3502 flow [2024-06-14 14:03:34,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 306 transitions, 3415 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-14 14:03:34,592 INFO L231 Difference]: Finished difference. Result has 336 places, 286 transitions, 2866 flow [2024-06-14 14:03:34,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2709, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2866, PETRI_PLACES=336, PETRI_TRANSITIONS=286} [2024-06-14 14:03:34,592 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 304 predicate places. [2024-06-14 14:03:34,592 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 286 transitions, 2866 flow [2024-06-14 14:03:34,592 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 14:03:34,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:03:34,592 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 14:03:34,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 14:03:34,592 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 14:03:34,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:03:34,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1135610045, now seen corresponding path program 9 times [2024-06-14 14:03:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:03:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494903956] [2024-06-14 14:03:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:03:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:03:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:03:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:03:40,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:03:40,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494903956] [2024-06-14 14:03:40,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494903956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:03:40,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:03:40,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:03:40,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230141188] [2024-06-14 14:03:40,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:03:40,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:03:40,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:03:40,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:03:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:03:40,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:03:40,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 286 transitions, 2866 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 14:03:40,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:03:40,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:03:40,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:03:41,113 INFO L124 PetriNetUnfolderBase]: 904/1628 cut-off events. [2024-06-14 14:03:41,113 INFO L125 PetriNetUnfolderBase]: For 103177/103177 co-relation queries the response was YES. [2024-06-14 14:03:41,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9406 conditions, 1628 events. 904/1628 cut-off events. For 103177/103177 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 9215 event pairs, 169 based on Foata normal form. 2/1629 useless extension candidates. Maximal degree in co-relation 9243. Up to 1420 conditions per place. [2024-06-14 14:03:41,133 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 257 selfloop transitions, 51 changer transitions 0/310 dead transitions. [2024-06-14 14:03:41,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 310 transitions, 3564 flow [2024-06-14 14:03:41,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:03:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:03:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-14 14:03:41,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3443526170798898 [2024-06-14 14:03:41,134 INFO L175 Difference]: Start difference. First operand has 336 places, 286 transitions, 2866 flow. Second operand 11 states and 125 transitions. [2024-06-14 14:03:41,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 310 transitions, 3564 flow [2024-06-14 14:03:41,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 310 transitions, 3429 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-14 14:03:41,537 INFO L231 Difference]: Finished difference. Result has 338 places, 287 transitions, 2863 flow [2024-06-14 14:03:41,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2731, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2863, PETRI_PLACES=338, PETRI_TRANSITIONS=287} [2024-06-14 14:03:41,537 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 306 predicate places. [2024-06-14 14:03:41,537 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 287 transitions, 2863 flow [2024-06-14 14:03:41,537 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 14:03:41,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:03:41,538 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 14:03:41,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 14:03:41,538 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 14:03:41,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:03:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1135847629, now seen corresponding path program 3 times [2024-06-14 14:03:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:03:41,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918244622] [2024-06-14 14:03:41,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:03:41,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:03:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:03:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:03:49,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:03:49,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918244622] [2024-06-14 14:03:49,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918244622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:03:49,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:03:49,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:03:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263317143] [2024-06-14 14:03:49,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:03:49,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:03:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:03:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:03:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:03:49,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:03:49,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 287 transitions, 2863 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 14:03:49,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:03:49,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:03:49,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:03:50,451 INFO L124 PetriNetUnfolderBase]: 910/1638 cut-off events. [2024-06-14 14:03:50,451 INFO L125 PetriNetUnfolderBase]: For 103295/103295 co-relation queries the response was YES. [2024-06-14 14:03:50,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9444 conditions, 1638 events. 910/1638 cut-off events. For 103295/103295 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9249 event pairs, 166 based on Foata normal form. 2/1639 useless extension candidates. Maximal degree in co-relation 9280. Up to 1369 conditions per place. [2024-06-14 14:03:50,470 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 247 selfloop transitions, 66 changer transitions 0/315 dead transitions. [2024-06-14 14:03:50,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 315 transitions, 3607 flow [2024-06-14 14:03:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:03:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:03:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-14 14:03:50,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34595959595959597 [2024-06-14 14:03:50,471 INFO L175 Difference]: Start difference. First operand has 338 places, 287 transitions, 2863 flow. Second operand 12 states and 137 transitions. [2024-06-14 14:03:50,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 315 transitions, 3607 flow [2024-06-14 14:03:50,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 315 transitions, 3489 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 14:03:50,955 INFO L231 Difference]: Finished difference. Result has 342 places, 289 transitions, 2938 flow [2024-06-14 14:03:50,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2745, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2938, PETRI_PLACES=342, PETRI_TRANSITIONS=289} [2024-06-14 14:03:50,955 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 310 predicate places. [2024-06-14 14:03:50,956 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 289 transitions, 2938 flow [2024-06-14 14:03:50,956 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 14:03:50,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:03:50,956 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 14:03:50,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 14:03:50,956 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 14:03:50,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:03:50,957 INFO L85 PathProgramCache]: Analyzing trace with hash 958478525, now seen corresponding path program 10 times [2024-06-14 14:03:50,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:03:50,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222391703] [2024-06-14 14:03:50,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:03:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:03:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:03:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:03:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:03:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222391703] [2024-06-14 14:03:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222391703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:03:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:03:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:03:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31140197] [2024-06-14 14:03:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:03:57,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:03:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:03:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:03:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:03:57,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:03:57,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 289 transitions, 2938 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 14:03:57,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:03:57,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:03:57,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:03:58,173 INFO L124 PetriNetUnfolderBase]: 914/1646 cut-off events. [2024-06-14 14:03:58,174 INFO L125 PetriNetUnfolderBase]: For 105843/105843 co-relation queries the response was YES. [2024-06-14 14:03:58,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9562 conditions, 1646 events. 914/1646 cut-off events. For 105843/105843 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 9340 event pairs, 174 based on Foata normal form. 2/1647 useless extension candidates. Maximal degree in co-relation 9397. Up to 1438 conditions per place. [2024-06-14 14:03:58,192 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 263 selfloop transitions, 46 changer transitions 0/311 dead transitions. [2024-06-14 14:03:58,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 311 transitions, 3632 flow [2024-06-14 14:03:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:03:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:03:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-14 14:03:58,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3443526170798898 [2024-06-14 14:03:58,194 INFO L175 Difference]: Start difference. First operand has 342 places, 289 transitions, 2938 flow. Second operand 11 states and 125 transitions. [2024-06-14 14:03:58,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 311 transitions, 3632 flow [2024-06-14 14:03:58,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 311 transitions, 3455 flow, removed 24 selfloop flow, removed 10 redundant places. [2024-06-14 14:03:58,669 INFO L231 Difference]: Finished difference. Result has 343 places, 290 transitions, 2885 flow [2024-06-14 14:03:58,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2761, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2885, PETRI_PLACES=343, PETRI_TRANSITIONS=290} [2024-06-14 14:03:58,670 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 311 predicate places. [2024-06-14 14:03:58,670 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 290 transitions, 2885 flow [2024-06-14 14:03:58,670 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 14:03:58,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:03:58,670 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 14:03:58,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 14:03:58,670 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 14:03:58,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:03:58,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1282861853, now seen corresponding path program 4 times [2024-06-14 14:03:58,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:03:58,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565701059] [2024-06-14 14:03:58,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:03:58,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:03:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:04:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:04:04,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:04:04,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565701059] [2024-06-14 14:04:04,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565701059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:04:04,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:04:04,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:04:04,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954063991] [2024-06-14 14:04:04,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:04:04,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:04:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:04:04,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:04:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:04:04,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:04:04,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 290 transitions, 2885 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 14:04:04,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:04:04,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:04:04,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:04:05,395 INFO L124 PetriNetUnfolderBase]: 920/1657 cut-off events. [2024-06-14 14:04:05,395 INFO L125 PetriNetUnfolderBase]: For 107981/107981 co-relation queries the response was YES. [2024-06-14 14:04:05,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9556 conditions, 1657 events. 920/1657 cut-off events. For 107981/107981 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 9418 event pairs, 109 based on Foata normal form. 2/1653 useless extension candidates. Maximal degree in co-relation 9390. Up to 863 conditions per place. [2024-06-14 14:04:05,415 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 143 selfloop transitions, 171 changer transitions 0/316 dead transitions. [2024-06-14 14:04:05,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 316 transitions, 3877 flow [2024-06-14 14:04:05,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:04:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:04:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:04:05,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-14 14:04:05,416 INFO L175 Difference]: Start difference. First operand has 343 places, 290 transitions, 2885 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:04:05,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 316 transitions, 3877 flow [2024-06-14 14:04:05,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 316 transitions, 3779 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 14:04:05,776 INFO L231 Difference]: Finished difference. Result has 346 places, 294 transitions, 3256 flow [2024-06-14 14:04:05,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2787, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3256, PETRI_PLACES=346, PETRI_TRANSITIONS=294} [2024-06-14 14:04:05,776 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 314 predicate places. [2024-06-14 14:04:05,776 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 294 transitions, 3256 flow [2024-06-14 14:04:05,777 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 14:04:05,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:04:05,777 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 14:04:05,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 14:04:05,777 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 14:04:05,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:04:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1196233423, now seen corresponding path program 11 times [2024-06-14 14:04:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:04:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536942243] [2024-06-14 14:04:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:04:05,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:04:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:04:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:04:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:04:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536942243] [2024-06-14 14:04:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536942243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:04:12,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:04:12,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:04:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589232566] [2024-06-14 14:04:12,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:04:12,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:04:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:04:12,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:04:12,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:04:12,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:04:12,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 294 transitions, 3256 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 14:04:12,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:04:12,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:04:12,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:04:13,057 INFO L124 PetriNetUnfolderBase]: 924/1664 cut-off events. [2024-06-14 14:04:13,057 INFO L125 PetriNetUnfolderBase]: For 110486/110486 co-relation queries the response was YES. [2024-06-14 14:04:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10024 conditions, 1664 events. 924/1664 cut-off events. For 110486/110486 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 9461 event pairs, 174 based on Foata normal form. 2/1665 useless extension candidates. Maximal degree in co-relation 9857. Up to 1442 conditions per place. [2024-06-14 14:04:13,074 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 267 selfloop transitions, 47 changer transitions 0/316 dead transitions. [2024-06-14 14:04:13,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 316 transitions, 3962 flow [2024-06-14 14:04:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:04:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:04:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 14:04:13,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34710743801652894 [2024-06-14 14:04:13,075 INFO L175 Difference]: Start difference. First operand has 346 places, 294 transitions, 3256 flow. Second operand 11 states and 126 transitions. [2024-06-14 14:04:13,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 316 transitions, 3962 flow [2024-06-14 14:04:13,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 316 transitions, 3694 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-14 14:04:13,591 INFO L231 Difference]: Finished difference. Result has 351 places, 295 transitions, 3116 flow [2024-06-14 14:04:13,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2988, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3116, PETRI_PLACES=351, PETRI_TRANSITIONS=295} [2024-06-14 14:04:13,591 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 319 predicate places. [2024-06-14 14:04:13,592 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 295 transitions, 3116 flow [2024-06-14 14:04:13,592 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 14:04:13,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:04:13,592 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 14:04:13,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 14:04:13,592 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 14:04:13,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:04:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1283100863, now seen corresponding path program 5 times [2024-06-14 14:04:13,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:04:13,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902943463] [2024-06-14 14:04:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:04:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:04:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:04:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:04:19,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:04:19,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902943463] [2024-06-14 14:04:19,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902943463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:04:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:04:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:04:19,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661845262] [2024-06-14 14:04:19,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:04:19,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:04:19,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:04:19,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:04:19,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:04:19,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:04:19,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 295 transitions, 3116 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 14:04:19,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:04:19,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:04:19,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:04:20,729 INFO L124 PetriNetUnfolderBase]: 930/1674 cut-off events. [2024-06-14 14:04:20,729 INFO L125 PetriNetUnfolderBase]: For 111915/111915 co-relation queries the response was YES. [2024-06-14 14:04:20,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9965 conditions, 1674 events. 930/1674 cut-off events. For 111915/111915 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 9543 event pairs, 172 based on Foata normal form. 2/1675 useless extension candidates. Maximal degree in co-relation 9796. Up to 1456 conditions per place. [2024-06-14 14:04:20,745 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 266 selfloop transitions, 54 changer transitions 0/322 dead transitions. [2024-06-14 14:04:20,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 322 transitions, 3868 flow [2024-06-14 14:04:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:04:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:04:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-14 14:04:20,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-14 14:04:20,746 INFO L175 Difference]: Start difference. First operand has 351 places, 295 transitions, 3116 flow. Second operand 12 states and 135 transitions. [2024-06-14 14:04:20,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 322 transitions, 3868 flow [2024-06-14 14:04:21,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 322 transitions, 3750 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 14:04:21,167 INFO L231 Difference]: Finished difference. Result has 354 places, 297 transitions, 3165 flow [2024-06-14 14:04:21,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2998, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3165, PETRI_PLACES=354, PETRI_TRANSITIONS=297} [2024-06-14 14:04:21,167 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 322 predicate places. [2024-06-14 14:04:21,168 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 297 transitions, 3165 flow [2024-06-14 14:04:21,168 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 14:04:21,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:04:21,168 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 14:04:21,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 14:04:21,168 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 14:04:21,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:04:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1460359297, now seen corresponding path program 12 times [2024-06-14 14:04:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:04:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229934077] [2024-06-14 14:04:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:04:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:04:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:04:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:04:27,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:04:27,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229934077] [2024-06-14 14:04:27,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229934077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:04:27,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:04:27,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:04:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28543408] [2024-06-14 14:04:27,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:04:27,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:04:27,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:04:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:04:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:04:27,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:04:27,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 297 transitions, 3165 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 14:04:27,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:04:27,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:04:27,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:04:28,037 INFO L124 PetriNetUnfolderBase]: 941/1695 cut-off events. [2024-06-14 14:04:28,037 INFO L125 PetriNetUnfolderBase]: For 124974/124974 co-relation queries the response was YES. [2024-06-14 14:04:28,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10365 conditions, 1695 events. 941/1695 cut-off events. For 124974/124974 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 9674 event pairs, 181 based on Foata normal form. 2/1696 useless extension candidates. Maximal degree in co-relation 10195. Up to 1426 conditions per place. [2024-06-14 14:04:28,058 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 269 selfloop transitions, 50 changer transitions 0/321 dead transitions. [2024-06-14 14:04:28,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 321 transitions, 4117 flow [2024-06-14 14:04:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:04:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:04:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 14:04:28,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34710743801652894 [2024-06-14 14:04:28,060 INFO L175 Difference]: Start difference. First operand has 354 places, 297 transitions, 3165 flow. Second operand 11 states and 126 transitions. [2024-06-14 14:04:28,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 321 transitions, 4117 flow [2024-06-14 14:04:28,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 321 transitions, 3973 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-14 14:04:28,530 INFO L231 Difference]: Finished difference. Result has 356 places, 299 transitions, 3187 flow [2024-06-14 14:04:28,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3021, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3187, PETRI_PLACES=356, PETRI_TRANSITIONS=299} [2024-06-14 14:04:28,531 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 324 predicate places. [2024-06-14 14:04:28,531 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 299 transitions, 3187 flow [2024-06-14 14:04:28,531 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 14:04:28,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:04:28,531 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 14:04:28,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-14 14:04:28,531 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 14:04:28,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:04:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash -936366159, now seen corresponding path program 1 times [2024-06-14 14:04:28,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:04:28,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026765988] [2024-06-14 14:04:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:04:28,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:04:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:04:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:04:35,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:04:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026765988] [2024-06-14 14:04:35,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026765988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:04:35,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:04:35,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:04:35,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598107603] [2024-06-14 14:04:35,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:04:35,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:04:35,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:04:35,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:04:35,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:04:36,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:04:36,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 299 transitions, 3187 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 14:04:36,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:04:36,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:04:36,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:04:36,732 INFO L124 PetriNetUnfolderBase]: 945/1703 cut-off events. [2024-06-14 14:04:36,732 INFO L125 PetriNetUnfolderBase]: For 128071/128071 co-relation queries the response was YES. [2024-06-14 14:04:36,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10424 conditions, 1703 events. 945/1703 cut-off events. For 128071/128071 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 9787 event pairs, 269 based on Foata normal form. 2/1704 useless extension candidates. Maximal degree in co-relation 10253. Up to 1588 conditions per place. [2024-06-14 14:04:36,754 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 283 selfloop transitions, 36 changer transitions 0/321 dead transitions. [2024-06-14 14:04:36,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 321 transitions, 3925 flow [2024-06-14 14:04:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:04:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:04:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2024-06-14 14:04:36,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31565656565656564 [2024-06-14 14:04:36,755 INFO L175 Difference]: Start difference. First operand has 356 places, 299 transitions, 3187 flow. Second operand 12 states and 125 transitions. [2024-06-14 14:04:36,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 321 transitions, 3925 flow [2024-06-14 14:04:37,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 321 transitions, 3832 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:04:37,304 INFO L231 Difference]: Finished difference. Result has 361 places, 300 transitions, 3214 flow [2024-06-14 14:04:37,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3094, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3214, PETRI_PLACES=361, PETRI_TRANSITIONS=300} [2024-06-14 14:04:37,304 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 329 predicate places. [2024-06-14 14:04:37,304 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 300 transitions, 3214 flow [2024-06-14 14:04:37,304 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 14:04:37,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:04:37,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:04:37,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-14 14:04:37,305 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 14:04:37,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:04:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1289536897, now seen corresponding path program 13 times [2024-06-14 14:04:37,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:04:37,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844839920] [2024-06-14 14:04:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:04:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:04:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:04:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:04:43,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:04:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844839920] [2024-06-14 14:04:43,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844839920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:04:43,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:04:43,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:04:43,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704183803] [2024-06-14 14:04:43,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:04:43,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:04:43,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:04:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:04:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:04:43,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-14 14:04:43,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 300 transitions, 3214 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 14:04:43,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:04:43,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-14 14:04:43,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:04:44,428 INFO L124 PetriNetUnfolderBase]: 949/1711 cut-off events. [2024-06-14 14:04:44,428 INFO L125 PetriNetUnfolderBase]: For 130165/130165 co-relation queries the response was YES. [2024-06-14 14:04:44,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10508 conditions, 1711 events. 949/1711 cut-off events. For 130165/130165 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 9826 event pairs, 179 based on Foata normal form. 2/1712 useless extension candidates. Maximal degree in co-relation 10335. Up to 1503 conditions per place. [2024-06-14 14:04:44,445 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 273 selfloop transitions, 48 changer transitions 0/323 dead transitions. [2024-06-14 14:04:44,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 323 transitions, 3938 flow [2024-06-14 14:04:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:04:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:04:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-14 14:04:44,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3443526170798898 [2024-06-14 14:04:44,446 INFO L175 Difference]: Start difference. First operand has 361 places, 300 transitions, 3214 flow. Second operand 11 states and 125 transitions. [2024-06-14 14:04:44,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 323 transitions, 3938 flow [2024-06-14 14:04:44,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 323 transitions, 3834 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-14 14:04:44,947 INFO L231 Difference]: Finished difference. Result has 362 places, 301 transitions, 3240 flow [2024-06-14 14:04:44,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3110, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3240, PETRI_PLACES=362, PETRI_TRANSITIONS=301} [2024-06-14 14:04:44,948 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 330 predicate places. [2024-06-14 14:04:44,948 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 301 transitions, 3240 flow [2024-06-14 14:04:44,948 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 14:04:44,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:04:44,948 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 14:04:44,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-14 14:04:44,948 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 14:04:44,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:04:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1455590753, now seen corresponding path program 6 times [2024-06-14 14:04:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:04:44,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667729242] [2024-06-14 14:04:44,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:04:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:04:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15